/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:39:58,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:39:58,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:39:58,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:39:58,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:39:58,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:39:58,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:39:58,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:39:58,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:39:58,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:39:58,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:39:58,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:39:58,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:39:58,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:39:58,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:39:58,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:39:58,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:39:58,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:39:58,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:39:58,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:39:58,220 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:39:58,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:39:58,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:39:58,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:39:58,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:39:58,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:39:58,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:39:58,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:39:58,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:39:58,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:39:58,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:39:58,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:39:58,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:39:58,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:39:58,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:39:58,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:39:58,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:39:58,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:39:58,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:39:58,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:39:58,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:39:58,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:39:58,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:39:58,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:39:58,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:39:58,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:39:58,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:39:58,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:39:58,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:39:58,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:39:58,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:39:58,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:39:58,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:39:58,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:39:58,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:39:58,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:39:58,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:39:58,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:39:58,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:39:58,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:39:58,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:39:58,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:39:58,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:39:58,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:39:58,255 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:39:58,255 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:39:58,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:39:58,255 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:39:58,255 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 06:39:58,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:39:58,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:39:58,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:39:58,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:39:58,460 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:39:58,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-15 06:39:58,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d2e18f6/358bd4252a274bea891cf37badec778a/FLAG410e6c1cb [2022-04-15 06:39:58,867 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:39:58,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-15 06:39:58,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d2e18f6/358bd4252a274bea891cf37badec778a/FLAG410e6c1cb [2022-04-15 06:39:58,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d2e18f6/358bd4252a274bea891cf37badec778a [2022-04-15 06:39:58,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:39:58,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:39:58,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:39:58,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:39:58,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:39:58,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:39:58" (1/1) ... [2022-04-15 06:39:58,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ee047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:58, skipping insertion in model container [2022-04-15 06:39:58,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:39:58" (1/1) ... [2022-04-15 06:39:58,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:39:58,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:39:59,047 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-de42.c[368,381] [2022-04-15 06:39:59,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:39:59,062 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:39:59,069 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-de42.c[368,381] [2022-04-15 06:39:59,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:39:59,081 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:39:59,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59 WrapperNode [2022-04-15 06:39:59,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:39:59,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:39:59,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:39:59,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:39:59,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:39:59,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:39:59,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:39:59,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:39:59,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (1/1) ... [2022-04-15 06:39:59,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:39:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:39:59,151 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 06:39:59,168 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 06:39:59,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:39:59,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:39:59,178 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:39:59,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:39:59,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:39:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:39:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:39:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:39:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:39:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:39:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:39:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:39:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:39:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:39:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:39:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:39:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:39:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:39:59,228 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:39:59,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:39:59,370 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:39:59,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:39:59,374 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 06:39:59,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:39:59 BoogieIcfgContainer [2022-04-15 06:39:59,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:39:59,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:39:59,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:39:59,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:39:59,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:39:58" (1/3) ... [2022-04-15 06:39:59,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4243ab4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:39:59, skipping insertion in model container [2022-04-15 06:39:59,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:39:59" (2/3) ... [2022-04-15 06:39:59,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4243ab4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:39:59, skipping insertion in model container [2022-04-15 06:39:59,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:39:59" (3/3) ... [2022-04-15 06:39:59,390 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.c [2022-04-15 06:39:59,393 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:39:59,393 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:39:59,422 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:39:59,428 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 06:39:59,428 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:39:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 06:39:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:39:59,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:39:59,443 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:39:59,444 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:39:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:39:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-15 06:39:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:59,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17592175] [2022-04-15 06:39:59,459 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:39:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-15 06:39:59,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:39:59,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260319284] [2022-04-15 06:39:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:39:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:39:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:59,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 06:39:59,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:39:59,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-15 06:39:59,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:39:59,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 06:39:59,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:39:59,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-15 06:39:59,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-15 06:39:59,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-15 06:39:59,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 06:39:59,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-15 06:39:59,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 06:39:59,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 06:39:59,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 06:39:59,637 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-15 06:39:59,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 06:39:59,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 06:39:59,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 06:39:59,638 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 06:39:59,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:39:59,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260319284] [2022-04-15 06:39:59,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260319284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:39:59,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:39:59,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:39:59,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:39:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17592175] [2022-04-15 06:39:59,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17592175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:39:59,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:39:59,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:39:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141664789] [2022-04-15 06:39:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:39:59,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:39:59,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:39:59,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:59,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:39:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:59,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:39:59,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:39:59,687 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:59,766 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 06:39:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:39:59,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:39:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:39:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 06:39:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 06:39:59,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-15 06:39:59,838 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 06:39:59,846 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:39:59,846 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:39:59,848 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 06:39:59,852 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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 06:39:59,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:39:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:39:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:39:59,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:39:59,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,879 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,879 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:59,881 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-15 06:39:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 06:39:59,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:59,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:59,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:39:59,883 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:39:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:59,884 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-15 06:39:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 06:39:59,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:59,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:59,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:39:59,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:39:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-15 06:39:59,888 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-15 06:39:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:39:59,889 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-15 06:39:59,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:59,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-15 06:39:59,919 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 06:39:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 06:39:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:39:59,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:39:59,920 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:39:59,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:39:59,921 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:39:59,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:39:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-15 06:39:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:59,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [914922285] [2022-04-15 06:39:59,922 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:39:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-15 06:39:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:39:59,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163391750] [2022-04-15 06:39:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:59,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:39:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:00,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-15 06:40:00,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-15 06:40:00,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-15 06:40:00,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:00,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-15 06:40:00,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-15 06:40:00,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-15 06:40:00,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-15 06:40:00,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:00,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:00,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-15 06:40:00,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:00,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:00,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:00,324 INFO L272 TraceCheckUtils]: 11: Hoare triple {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:00,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {187#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:00,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {187#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-15 06:40:00,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-15 06:40:00,326 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 06:40:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:00,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163391750] [2022-04-15 06:40:00,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163391750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:00,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:00,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:40:00,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:00,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [914922285] [2022-04-15 06:40:00,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [914922285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:00,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:00,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:40:00,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354208645] [2022-04-15 06:40:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:00,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:40:00,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:00,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:00,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:00,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:40:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:00,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:40:00,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:40:00,347 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:00,685 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-15 06:40:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:40:00,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:40:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 06:40:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 06:40:00,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-15 06:40:00,730 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 06:40:00,731 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:40:00,731 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:40:00,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:40:00,732 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:00,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:40:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 06:40:00,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:00,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 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 06:40:00,743 INFO L74 IsIncluded]: Start isIncluded. First operand 23 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 06:40:00,744 INFO L87 Difference]: Start difference. First operand 23 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 06:40:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:00,745 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 06:40:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 06:40:00,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:00,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:00,745 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 23 states. [2022-04-15 06:40:00,746 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 23 states. [2022-04-15 06:40:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:00,747 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 06:40:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 06:40:00,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:00,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:00,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:00,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:00,747 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 06:40:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-15 06:40:00,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-15 06:40:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:00,748 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-15 06:40:00,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:00,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-15 06:40:00,781 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 06:40:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 06:40:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:40:00,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:00,782 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:00,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:40:00,782 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 1 times [2022-04-15 06:40:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:00,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869924657] [2022-04-15 06:40:00,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:40:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 2 times [2022-04-15 06:40:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:00,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571425699] [2022-04-15 06:40:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:00,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:00,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-15 06:40:00,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-15 06:40:00,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-15 06:40:00,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:00,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-15 06:40:00,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-15 06:40:00,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-15 06:40:00,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-15 06:40:00,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(= main_~y~0 0)} is VALID [2022-04-15 06:40:00,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-15 06:40:00,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#(= main_~y~0 0)} ~z~0 := ~y~0; {362#(= main_~y~0 0)} is VALID [2022-04-15 06:40:00,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-15 06:40:00,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(= 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; {358#false} is VALID [2022-04-15 06:40:00,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-15 06:40:00,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-15 06:40:00,838 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-15 06:40:00,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-15 06:40:00,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-15 06:40:00,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-15 06:40:00,838 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 06:40:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571425699] [2022-04-15 06:40:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571425699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:00,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:00,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:00,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869924657] [2022-04-15 06:40:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869924657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:00,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:00,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526100892] [2022-04-15 06:40:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 06:40:00,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:00,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 06:40:00,853 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 06:40:00,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:40:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:40:00,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:40:00,854 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 06:40:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:00,964 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 06:40:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:40:00,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 06:40:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 06:40:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 06:40:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 06:40:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 06:40:00,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 06:40:00,997 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 06:40:00,998 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:40:00,998 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:40:00,999 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 06:40:00,999 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 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 06:40:00,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:40:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-15 06:40:01,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:01,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:01,004 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:01,004 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:01,005 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 06:40:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 06:40:01,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:01,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:01,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states 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 06:40:01,006 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states 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 06:40:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:01,007 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 06:40:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 06:40:01,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:01,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:01,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:01,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 06:40:01,008 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2022-04-15 06:40:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:01,009 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 06:40:01,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 06:40:01,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 06:40:01,027 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 06:40:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 06:40:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:40:01,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:01,028 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:01,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:40:01,028 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1509444864, now seen corresponding path program 1 times [2022-04-15 06:40:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538278270] [2022-04-15 06:40:02,532 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:02,534 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:02,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1734323905, now seen corresponding path program 1 times [2022-04-15 06:40:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:02,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185156268] [2022-04-15 06:40:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:02,548 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:02,590 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:02,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {522#true} is VALID [2022-04-15 06:40:02,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-15 06:40:02,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-15 06:40:02,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {522#true} call ULTIMATE.init(); {533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:02,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {522#true} is VALID [2022-04-15 06:40:02,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-15 06:40:02,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-15 06:40:02,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {522#true} call #t~ret13 := main(); {522#true} is VALID [2022-04-15 06:40:02,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {527#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:02,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {527#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:02,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:02,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [76] L23-2-->L29-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse1 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse3 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse4 (= v_main_~z~0_13 v_main_~z~0_12)) (.cse2 (mod v_main_~z~0_13 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~z~0_12 v_main_~z~0_13) (= (+ v_main_~x~0_11 v_main_~z~0_13 (* (- 1) v_main_~z~0_12)) v_main_~x~0_10) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_12 v_it_1 1) v_main_~z~0_13)) (not (<= 1 v_it_1)) (< 0 (mod (+ v_main_~z~0_13 (* v_it_1 4294967295)) 4294967296)))) (< 0 .cse2)))) InVars {main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_13, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_10, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_12, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {529#(< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-15 06:40:02,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#(< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))} [75] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:02,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:02,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:02,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {531#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:02,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {532#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:02,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {523#false} is VALID [2022-04-15 06:40:02,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#false} assume !false; {523#false} is VALID [2022-04-15 06:40:02,736 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 06:40:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:02,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185156268] [2022-04-15 06:40:02,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185156268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:02,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:02,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:40:03,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538278270] [2022-04-15 06:40:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538278270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:03,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:03,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:40:03,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785191849] [2022-04-15 06:40:03,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:03,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:03,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:03,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:03,192 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 06:40:03,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:40:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:40:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:03,194 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:03,476 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 06:40:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:40:03,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-15 06:40:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-15 06:40:03,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2022-04-15 06:40:03,879 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 06:40:03,880 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:40:03,880 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:40:03,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:40:03,881 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:03,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 49 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-04-15 06:40:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:40:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-15 06:40:03,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:03,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:03,894 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:03,894 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:03,895 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-15 06:40:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-15 06:40:03,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:03,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:03,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states 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 06:40:03,896 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states 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 06:40:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:03,897 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-04-15 06:40:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-15 06:40:03,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:03,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:03,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:03,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 06:40:03,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2022-04-15 06:40:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:03,899 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 06:40:03,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:03,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 06:40:04,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 06:40:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:40:04,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:04,165 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:04,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:40:04,166 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-15 06:40:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:04,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548671835] [2022-04-15 06:40:08,275 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:40:08,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:08,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1936464066, now seen corresponding path program 1 times [2022-04-15 06:40:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:08,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55742554] [2022-04-15 06:40:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:08,421 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:08,462 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:08,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {705#true} is VALID [2022-04-15 06:40:08,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 06:40:08,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {705#true} {705#true} #72#return; {705#true} is VALID [2022-04-15 06:40:08,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:08,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {705#true} is VALID [2022-04-15 06:40:08,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 06:40:08,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #72#return; {705#true} is VALID [2022-04-15 06:40:08,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2022-04-15 06:40:08,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:08,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [78] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_9 v_main_~y~0_8)) (.cse3 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse4 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse0 (mod v_main_~x~0_18 4294967296))) (or (and (< v_main_~x~0_17 v_main_~x~0_18) (= v_main_~y~0_8 (+ v_main_~x~0_18 v_main_~y~0_9 (* (- 1) v_main_~x~0_17))) (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~x~0_18 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_17 v_it_2 1) v_main_~x~0_18)) (not (<= 1 v_it_2)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_18, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_17, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {711#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 06:40:08,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} [77] 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[] {712#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 06:40:08,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(or (<= (+ main_~y~0 (* (div (+ 4294967295 (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296)) (* main_~n~0 2)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {713#(or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (and (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~z~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 06:40:08,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (and (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~z~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !(~z~0 % 4294967296 > 0); {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:08,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:08,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:08,689 INFO L272 TraceCheckUtils]: 12: Hoare triple {714#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {715#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:08,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {716#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:08,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {706#false} is VALID [2022-04-15 06:40:08,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {706#false} assume !false; {706#false} is VALID [2022-04-15 06:40:08,690 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 06:40:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:08,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55742554] [2022-04-15 06:40:08,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55742554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:08,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:08,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:40:09,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:09,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548671835] [2022-04-15 06:40:09,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548671835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:09,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:09,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:40:09,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486483389] [2022-04-15 06:40:09,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:09,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:09,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:09,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:09,130 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 06:40:09,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:40:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:40:09,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:40:09,131 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:09,661 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-15 06:40:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:40:09,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 06:40:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 06:40:09,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-15 06:40:09,730 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 06:40:09,731 INFO L225 Difference]: With dead ends: 37 [2022-04-15 06:40:09,731 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:40:09,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:40:09,732 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:09,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-04-15 06:40:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:40:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-15 06:40:09,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:09,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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 06:40:09,767 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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 06:40:09,767 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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 06:40:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:09,768 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-15 06:40:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 06:40:09,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:09,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:09,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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 32 states. [2022-04-15 06:40:09,769 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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 32 states. [2022-04-15 06:40:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:09,770 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-15 06:40:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 06:40:09,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:09,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:09,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:09,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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 06:40:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-04-15 06:40:09,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2022-04-15 06:40:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:09,772 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-04-15 06:40:09,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 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 06:40:09,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 31 transitions. [2022-04-15 06:40:09,986 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 06:40:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-04-15 06:40:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:09,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:09,987 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 06:40:09,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:40:09,987 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-15 06:40:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432184823] [2022-04-15 06:40:10,189 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:10,191 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2000352087, now seen corresponding path program 1 times [2022-04-15 06:40:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:10,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127287922] [2022-04-15 06:40:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:10,201 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:10,221 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:10,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:10,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-15 06:40:10,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 06:40:10,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {922#true} {922#true} #72#return; {922#true} is VALID [2022-04-15 06:40:10,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:10,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-15 06:40:10,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 06:40:10,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #72#return; {922#true} is VALID [2022-04-15 06:40:10,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret13 := main(); {922#true} is VALID [2022-04-15 06:40:10,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {927#(= main_~y~0 0)} is VALID [2022-04-15 06:40:10,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {927#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {928#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:10,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {929#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:10,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [80] L23-2-->L29-1_primed: Formula: (let ((.cse1 (= v_main_~z~0_20 v_main_~z~0_19)) (.cse0 (mod v_main_~z~0_20 4294967296)) (.cse2 (= |v_main_#t~post8_9| |v_main_#t~post8_8|)) (.cse3 (= |v_main_#t~post7_9| |v_main_#t~post7_8|)) (.cse4 (= v_main_~x~0_25 v_main_~x~0_24))) (or (and (= v_main_~z~0_19 (+ v_main_~x~0_25 v_main_~z~0_20 (* (- 1) v_main_~x~0_24))) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_24)) (< 0 (mod (+ v_main_~z~0_20 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~x~0_25 v_main_~x~0_24) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~x~0=v_main_~x~0_25, main_#t~post8=|v_main_#t~post8_9|, main_~z~0=v_main_~z~0_20, main_#t~post7=|v_main_#t~post7_9|} OutVars{main_~x~0=v_main_~x~0_24, main_#t~post8=|v_main_#t~post8_8|, main_~z~0=v_main_~z~0_19, main_#t~post7=|v_main_#t~post7_8|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:10,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [79] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:10,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {930#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:10,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {930#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {923#false} is VALID [2022-04-15 06:40:10,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {923#false} assume !(~x~0 % 4294967296 > 0); {923#false} is VALID [2022-04-15 06:40:10,288 INFO L272 TraceCheckUtils]: 13: Hoare triple {923#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {923#false} is VALID [2022-04-15 06:40:10,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {923#false} ~cond := #in~cond; {923#false} is VALID [2022-04-15 06:40:10,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {923#false} assume 0 == ~cond; {923#false} is VALID [2022-04-15 06:40:10,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-15 06:40:10,289 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 06:40:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127287922] [2022-04-15 06:40:10,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127287922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:10,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:10,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:40:10,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:10,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432184823] [2022-04-15 06:40:10,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432184823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:10,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:10,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:40:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481790242] [2022-04-15 06:40:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:10,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 06:40:10,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:10,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 06:40:10,330 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 06:40:10,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:40:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:10,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:40:10,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:40:10,330 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 06:40:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:10,515 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-15 06:40:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:40:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 06:40:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 06:40:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 06:40:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 06:40:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 06:40:10,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 06:40:10,545 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 06:40:10,546 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:40:10,546 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:40:10,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:10,546 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:10,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:40:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 06:40:10,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:10,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:10,582 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:10,582 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:10,583 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-15 06:40:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 06:40:10,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:10,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:10,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:40:10,583 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:40:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:10,584 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-15 06:40:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 06:40:10,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:10,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:10,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:10,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 06:40:10,585 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2022-04-15 06:40:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:10,585 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 06:40:10,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 06:40:10,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 06:40:10,814 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 06:40:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 06:40:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:10,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:10,814 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 06:40:10,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:40:10,814 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1952840614, now seen corresponding path program 1 times [2022-04-15 06:40:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:10,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036625398] [2022-04-15 06:40:10,995 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:10,997 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1954242533, now seen corresponding path program 1 times [2022-04-15 06:40:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:10,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359814789] [2022-04-15 06:40:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:11,007 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:40:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:11,018 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:40:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:11,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1092#true} is VALID [2022-04-15 06:40:11,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-15 06:40:11,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1092#true} {1092#true} #72#return; {1092#true} is VALID [2022-04-15 06:40:11,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:11,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1092#true} is VALID [2022-04-15 06:40:11,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-15 06:40:11,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #72#return; {1092#true} is VALID [2022-04-15 06:40:11,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret13 := main(); {1092#true} is VALID [2022-04-15 06:40:11,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1092#true} is VALID [2022-04-15 06:40:11,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {1092#true} [82] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~x~0_33 v_main_~x~0_32)) (.cse4 (= v_main_~y~0_16 v_main_~y~0_15)) (.cse0 (mod v_main_~x~0_33 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (= v_main_~x~0_32 (+ v_main_~x~0_33 v_main_~y~0_16 (* (- 1) v_main_~y~0_15))) (< v_main_~y~0_16 v_main_~y~0_15) (< 0 .cse0) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_16 v_it_4 1) v_main_~y~0_15)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_33) 4294967296)) (not (<= 1 v_it_4))))))) InVars {main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1092#true} is VALID [2022-04-15 06:40:11,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#true} [81] 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[] {1092#true} is VALID [2022-04-15 06:40:11,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#true} ~z~0 := ~y~0; {1097#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:40:11,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1098#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:11,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(and (= main_~z~0 main_~y~0) (<= 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; {1093#false} is VALID [2022-04-15 06:40:11,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {1093#false} assume !(~y~0 % 4294967296 > 0); {1093#false} is VALID [2022-04-15 06:40:11,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {1093#false} assume !(~x~0 % 4294967296 > 0); {1093#false} is VALID [2022-04-15 06:40:11,062 INFO L272 TraceCheckUtils]: 13: Hoare triple {1093#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1093#false} is VALID [2022-04-15 06:40:11,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2022-04-15 06:40:11,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2022-04-15 06:40:11,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2022-04-15 06:40:11,063 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 06:40:11,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:11,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359814789] [2022-04-15 06:40:11,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359814789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:11,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:11,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:40:11,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:11,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036625398] [2022-04-15 06:40:11,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036625398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:11,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:11,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894710175] [2022-04-15 06:40:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 06:40:11,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:11,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 06:40:11,130 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 06:40:11,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:11,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:11,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:40:11,131 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 06:40:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:11,287 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 06:40:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:40:11,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 06:40:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 06:40:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 06:40:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 06:40:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 06:40:11,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-15 06:40:11,314 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 06:40:11,314 INFO L225 Difference]: With dead ends: 27 [2022-04-15 06:40:11,314 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 06:40:11,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:11,315 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:11,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 06:40:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-15 06:40:11,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:11,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 06:40:11,341 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 06:40:11,341 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 06:40:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:11,342 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-15 06:40:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-15 06:40:11,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:11,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:11,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 19 states. [2022-04-15 06:40:11,342 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 19 states. [2022-04-15 06:40:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:11,343 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-15 06:40:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-15 06:40:11,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:11,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:11,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:11,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 06:40:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-15 06:40:11,344 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 17 [2022-04-15 06:40:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:11,344 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-15 06:40:11,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 06:40:11,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-15 06:40:11,378 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 06:40:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 06:40:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:11,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:11,379 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 06:40:11,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 06:40:11,379 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1804119273, now seen corresponding path program 1 times [2022-04-15 06:40:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:11,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [118211131] [2022-04-15 06:40:13,500 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:40:13,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:13,593 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1494679786, now seen corresponding path program 1 times [2022-04-15 06:40:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:13,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091612724] [2022-04-15 06:40:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:13,603 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:13,613 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:13,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {1245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-15 06:40:13,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-15 06:40:13,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-15 06:40:13,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {1238#true} call ULTIMATE.init(); {1245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:13,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-15 06:40:13,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-15 06:40:13,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-15 06:40:13,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {1238#true} call #t~ret13 := main(); {1238#true} is VALID [2022-04-15 06:40:13,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1238#true} is VALID [2022-04-15 06:40:13,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_40 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse1 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~x~0_39 (+ v_main_~x~0_40 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< 0 .cse3) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~y~0_24 v_it_5 1) v_main_~y~0_23)) (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1238#true} is VALID [2022-04-15 06:40:13,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} [83] 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[] {1243#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:13,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1243#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:13,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {1243#(<= 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; {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:13,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:13,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:13,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1244#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-15 06:40:13,649 INFO L272 TraceCheckUtils]: 13: Hoare triple {1239#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#false} is VALID [2022-04-15 06:40:13,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#false} ~cond := #in~cond; {1239#false} is VALID [2022-04-15 06:40:13,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#false} assume 0 == ~cond; {1239#false} is VALID [2022-04-15 06:40:13,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-04-15 06:40:13,649 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 06:40:13,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:13,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091612724] [2022-04-15 06:40:13,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091612724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:13,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450434910] [2022-04-15 06:40:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:13,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:13,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:13,657 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 06:40:13,658 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 06:40:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:13,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:40:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:13,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:13,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {1238#true} call ULTIMATE.init(); {1238#true} is VALID [2022-04-15 06:40:13,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-15 06:40:13,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-15 06:40:13,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-15 06:40:13,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {1238#true} call #t~ret13 := main(); {1238#true} is VALID [2022-04-15 06:40:13,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1238#true} is VALID [2022-04-15 06:40:13,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_40 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse1 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~x~0_39 (+ v_main_~x~0_40 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< 0 .cse3) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~y~0_24 v_it_5 1) v_main_~y~0_23)) (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1238#true} is VALID [2022-04-15 06:40:13,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} [83] 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[] {1238#true} is VALID [2022-04-15 06:40:13,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {1238#true} ~z~0 := ~y~0; {1273#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:40:13,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {1273#(= 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; {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:13,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:13,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-15 06:40:13,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {1239#false} assume !(~x~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-15 06:40:13,758 INFO L272 TraceCheckUtils]: 13: Hoare triple {1239#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#false} is VALID [2022-04-15 06:40:13,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#false} ~cond := #in~cond; {1239#false} is VALID [2022-04-15 06:40:13,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#false} assume 0 == ~cond; {1239#false} is VALID [2022-04-15 06:40:13,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-04-15 06:40:13,759 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 06:40:13,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:13,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-04-15 06:40:13,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#false} assume 0 == ~cond; {1239#false} is VALID [2022-04-15 06:40:13,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#false} ~cond := #in~cond; {1239#false} is VALID [2022-04-15 06:40:13,809 INFO L272 TraceCheckUtils]: 13: Hoare triple {1239#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#false} is VALID [2022-04-15 06:40:13,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1239#false} assume !(~x~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-15 06:40:13,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1239#false} is VALID [2022-04-15 06:40:13,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:13,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(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; {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:13,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1238#true} ~z~0 := ~y~0; {1320#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:40:13,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} [83] 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[] {1238#true} is VALID [2022-04-15 06:40:13,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {1238#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_40 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse1 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~x~0_39 (+ v_main_~x~0_40 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< 0 .cse3) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~y~0_24 v_it_5 1) v_main_~y~0_23)) (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1238#true} is VALID [2022-04-15 06:40:13,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1238#true} is VALID [2022-04-15 06:40:13,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {1238#true} call #t~ret13 := main(); {1238#true} is VALID [2022-04-15 06:40:13,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1238#true} {1238#true} #72#return; {1238#true} is VALID [2022-04-15 06:40:13,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-04-15 06:40:13,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1238#true} is VALID [2022-04-15 06:40:13,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {1238#true} call ULTIMATE.init(); {1238#true} is VALID [2022-04-15 06:40:13,816 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 06:40:13,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450434910] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:13,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:40:13,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2022-04-15 06:40:13,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:13,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [118211131] [2022-04-15 06:40:13,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [118211131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:13,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:13,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:40:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006290066] [2022-04-15 06:40:13,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:13,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 06:40:13,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:13,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 06:40:13,879 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 06:40:13,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:40:13,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:13,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:40:13,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:13,880 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 06:40:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:13,977 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 06:40:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:40:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 06:40:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 06:40:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 06:40:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 06:40:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 06:40:13,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 06:40:14,001 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 06:40:14,001 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:40:14,001 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:40:14,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:40:14,002 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:14,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:40:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 06:40:14,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:14,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:14,032 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:14,032 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:14,032 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 06:40:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 06:40:14,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:14,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:40:14,033 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:40:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:14,034 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 06:40:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 06:40:14,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:14,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:14,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:14,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 06:40:14,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2022-04-15 06:40:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:14,035 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 06:40:14,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 06:40:14,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 06:40:14,079 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 06:40:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 06:40:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:40:14,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:14,079 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 06:40:14,099 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 06:40:14,280 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 06:40:14,280 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-15 06:40:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:14,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492092142] [2022-04-15 06:40:14,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:14,518 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash -988846895, now seen corresponding path program 1 times [2022-04-15 06:40:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:14,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126074015] [2022-04-15 06:40:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:14,541 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:14,549 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:14,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-15 06:40:14,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 06:40:14,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-15 06:40:14,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:14,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-15 06:40:14,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 06:40:14,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-15 06:40:14,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret13 := main(); {1483#true} is VALID [2022-04-15 06:40:14,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1483#true} is VALID [2022-04-15 06:40:14,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1483#true} [86] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_48 4294967296)) (.cse1 (= v_main_~x~0_48 v_main_~x~0_47)) (.cse2 (= v_main_~y~0_31 v_main_~y~0_30)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< v_main_~y~0_31 v_main_~y~0_30) (< 0 .cse0) (= v_main_~x~0_47 (+ v_main_~x~0_48 v_main_~y~0_31 (* (- 1) v_main_~y~0_30))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_31 v_it_6 1) v_main_~y~0_30)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_48 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_30, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_47, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1483#true} is VALID [2022-04-15 06:40:14,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} [85] 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[] {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:14,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:14,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1488#(<= 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; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:14,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:14,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1489#(<= (+ (* 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; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:14,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:14,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1484#false} is VALID [2022-04-15 06:40:14,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {1484#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1484#false} is VALID [2022-04-15 06:40:14,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {1484#false} ~cond := #in~cond; {1484#false} is VALID [2022-04-15 06:40:14,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1484#false} assume 0 == ~cond; {1484#false} is VALID [2022-04-15 06:40:14,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-15 06:40:14,586 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 06:40:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126074015] [2022-04-15 06:40:14,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126074015] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:14,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459009608] [2022-04-15 06:40:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:14,587 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 06:40:14,591 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 06:40:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:14,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:40:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:14,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:14,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-15 06:40:14,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-15 06:40:14,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 06:40:14,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-15 06:40:14,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret13 := main(); {1483#true} is VALID [2022-04-15 06:40:14,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1483#true} is VALID [2022-04-15 06:40:14,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {1483#true} [86] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_48 4294967296)) (.cse1 (= v_main_~x~0_48 v_main_~x~0_47)) (.cse2 (= v_main_~y~0_31 v_main_~y~0_30)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< v_main_~y~0_31 v_main_~y~0_30) (< 0 .cse0) (= v_main_~x~0_47 (+ v_main_~x~0_48 v_main_~y~0_31 (* (- 1) v_main_~y~0_30))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_31 v_it_6 1) v_main_~y~0_30)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_48 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_30, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_47, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1483#true} is VALID [2022-04-15 06:40:14,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} [85] 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[] {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:14,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1488#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:14,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {1488#(<= 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; {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:14,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:14,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:14,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:14,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {1484#false} is VALID [2022-04-15 06:40:14,904 INFO L272 TraceCheckUtils]: 14: Hoare triple {1484#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1484#false} is VALID [2022-04-15 06:40:14,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {1484#false} ~cond := #in~cond; {1484#false} is VALID [2022-04-15 06:40:14,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {1484#false} assume 0 == ~cond; {1484#false} is VALID [2022-04-15 06:40:14,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-15 06:40:14,905 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 06:40:14,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:15,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-15 06:40:15,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {1484#false} assume 0 == ~cond; {1484#false} is VALID [2022-04-15 06:40:15,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {1484#false} ~cond := #in~cond; {1484#false} is VALID [2022-04-15 06:40:15,015 INFO L272 TraceCheckUtils]: 14: Hoare triple {1484#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1484#false} is VALID [2022-04-15 06:40:15,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1484#false} is VALID [2022-04-15 06:40:15,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:15,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {1489#(<= (+ (* 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; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:15,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:15,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1489#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:15,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 06:40:15,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} [85] 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[] {1570#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 06:40:15,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {1483#true} [86] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_48 4294967296)) (.cse1 (= v_main_~x~0_48 v_main_~x~0_47)) (.cse2 (= v_main_~y~0_31 v_main_~y~0_30)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< v_main_~y~0_31 v_main_~y~0_30) (< 0 .cse0) (= v_main_~x~0_47 (+ v_main_~x~0_48 v_main_~y~0_31 (* (- 1) v_main_~y~0_30))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_31 v_it_6 1) v_main_~y~0_30)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_48 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_30, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_47, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1483#true} is VALID [2022-04-15 06:40:15,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1483#true} is VALID [2022-04-15 06:40:15,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret13 := main(); {1483#true} is VALID [2022-04-15 06:40:15,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #72#return; {1483#true} is VALID [2022-04-15 06:40:15,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 06:40:15,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-15 06:40:15,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-15 06:40:15,019 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 06:40:15,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459009608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:15,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 06:40:15,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:15,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [492092142] [2022-04-15 06:40:15,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [492092142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:15,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:15,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:15,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569851147] [2022-04-15 06:40:15,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:15,045 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 06:40:15,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:15,046 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 06:40:15,058 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 06:40:15,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:15,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:15,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:40:15,059 INFO L87 Difference]: Start difference. First operand 19 states and 22 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 06:40:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:15,289 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-15 06:40:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:40:15,290 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 06:40:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:15,290 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 06:40:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-15 06:40:15,291 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 06:40:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-15 06:40:15,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-15 06:40:15,336 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 06:40:15,337 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:40:15,337 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 06:40:15,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:15,337 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:15,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 06:40:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-15 06:40:15,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:15,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 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 06:40:15,382 INFO L74 IsIncluded]: Start isIncluded. First operand 28 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 06:40:15,382 INFO L87 Difference]: Start difference. First operand 28 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 06:40:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:15,384 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 06:40:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 06:40:15,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:15,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:15,384 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 28 states. [2022-04-15 06:40:15,384 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 28 states. [2022-04-15 06:40:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:15,385 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 06:40:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 06:40:15,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:15,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:15,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:15,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:15,385 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 06:40:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-15 06:40:15,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2022-04-15 06:40:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:15,386 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-15 06:40:15,386 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 06:40:15,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-15 06:40:15,520 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 06:40:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 06:40:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:40:15,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:15,522 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 06:40:15,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 06:40:15,723 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 06:40:15,723 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-15 06:40:15,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:15,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915370359] [2022-04-15 06:40:15,904 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:15,906 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -883628153, now seen corresponding path program 1 times [2022-04-15 06:40:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:15,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945154151] [2022-04-15 06:40:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:15,916 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:15,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:16,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {1793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-15 06:40:16,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-15 06:40:16,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-15 06:40:16,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:16,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-15 06:40:16,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-15 06:40:16,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-15 06:40:16,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret13 := main(); {1778#true} is VALID [2022-04-15 06:40:16,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:16,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [88] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_58 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58) (= v_main_~y~0_39 (+ v_main_~x~0_58 v_main_~y~0_40 (* (- 1) v_main_~x~0_57)))) (and .cse1 (= v_main_~y~0_39 v_main_~y~0_40) (<= .cse0 0) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_40 v_main_~y~0_39) .cse3))) InVars {main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_39, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1784#(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 06:40:16,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {1784#(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))))} [87] 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[] {1785#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 06:40:16,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {1786#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 06:40:16,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1787#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) 1))} is VALID [2022-04-15 06:40:16,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {1787#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) 1))} assume !(~z~0 % 4294967296 > 0); {1788#(and (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:16,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {1788#(and (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* main_~n~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; {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-15 06:40:16,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-15 06:40:16,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {1789#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:16,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:16,294 INFO L272 TraceCheckUtils]: 15: Hoare triple {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1791#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:16,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {1791#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1792#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:16,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {1792#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1779#false} is VALID [2022-04-15 06:40:16,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-15 06:40:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:16,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:16,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945154151] [2022-04-15 06:40:16,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945154151] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:16,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083559775] [2022-04-15 06:40:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:16,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:16,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:16,296 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 06:40:16,296 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 06:40:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:16,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:40:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:40:18,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:53,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-15 06:40:53,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-15 06:40:53,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-15 06:40:53,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-15 06:40:53,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret13 := main(); {1778#true} is VALID [2022-04-15 06:40:53,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:53,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [88] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_58 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58) (= v_main_~y~0_39 (+ v_main_~x~0_58 v_main_~y~0_40 (* (- 1) v_main_~x~0_57)))) (and .cse1 (= v_main_~y~0_39 v_main_~y~0_40) (<= .cse0 0) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_40 v_main_~y~0_39) .cse3))) InVars {main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_39, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 06:40:53,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [87] 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[] {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 06:40:53,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {1815#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} ~z~0 := ~y~0; {1822#(and (= main_~z~0 main_~y~0) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} is VALID [2022-04-15 06:40:53,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {1822#(and (= main_~z~0 main_~y~0) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) 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; {1826#(and (or (and (= main_~y~0 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 06:40:53,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {1826#(and (or (and (= main_~y~0 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0))) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1830#(and (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod main_~z~0 4294967296))) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 06:40:53,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1830#(and (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod main_~z~0 4294967296))) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1834#(and (not (< 0 (mod main_~y~0 4294967296))) (< main_~x~0 (+ main_~n~0 1)) (= main_~z~0 (+ main_~y~0 1)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-15 06:40:53,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1834#(and (not (< 0 (mod main_~y~0 4294967296))) (< main_~x~0 (+ main_~n~0 1)) (= main_~z~0 (+ main_~y~0 1)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1838#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-15 06:40:53,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {1838#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1842#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 1 main_~z~0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-15 06:40:53,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {1842#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 1 main_~z~0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1846#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (< 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 06:40:55,219 WARN L272 TraceCheckUtils]: 15: Hoare triple {1846#(and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 2) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (< 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1850#(exists ((aux_mod_v_main_~n~0_BEFORE_CALL_1_109 Int) (aux_mod_v_main_~z~0_BEFORE_CALL_1_57 Int) (aux_div_v_main_~z~0_BEFORE_CALL_1_57 Int)) (and (< 4294967295 (+ (* aux_div_v_main_~z~0_BEFORE_CALL_1_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_1_57)) (<= aux_mod_v_main_~z~0_BEFORE_CALL_1_57 0) (<= aux_mod_v_main_~n~0_BEFORE_CALL_1_109 0) (<= 0 aux_mod_v_main_~z~0_BEFORE_CALL_1_57) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_1_109) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 4294967296) (+ (* aux_div_v_main_~z~0_BEFORE_CALL_1_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_1_57))) (< 0 (mod (+ aux_mod_v_main_~n~0_BEFORE_CALL_1_109 aux_mod_v_main_~z~0_BEFORE_CALL_1_57 (* v_it_7 4294967295) 1) 4294967296)) (not (<= 1 v_it_7))))))} is UNKNOWN [2022-04-15 06:40:55,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {1850#(exists ((aux_mod_v_main_~n~0_BEFORE_CALL_1_109 Int) (aux_mod_v_main_~z~0_BEFORE_CALL_1_57 Int) (aux_div_v_main_~z~0_BEFORE_CALL_1_57 Int)) (and (< 4294967295 (+ (* aux_div_v_main_~z~0_BEFORE_CALL_1_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_1_57)) (<= aux_mod_v_main_~z~0_BEFORE_CALL_1_57 0) (<= aux_mod_v_main_~n~0_BEFORE_CALL_1_109 0) (<= 0 aux_mod_v_main_~z~0_BEFORE_CALL_1_57) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_1_109) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 4294967296) (+ (* aux_div_v_main_~z~0_BEFORE_CALL_1_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_1_57))) (< 0 (mod (+ aux_mod_v_main_~n~0_BEFORE_CALL_1_109 aux_mod_v_main_~z~0_BEFORE_CALL_1_57 (* v_it_7 4294967295) 1) 4294967296)) (not (<= 1 v_it_7))))))} ~cond := #in~cond; {1854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:40:55,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-15 06:40:55,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-15 06:40:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:55,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:15,567 WARN L232 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 06:42:18,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-15 06:42:18,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {1854#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-15 06:42:18,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:42:18,580 INFO L272 TraceCheckUtils]: 15: Hoare triple {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:42:18,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {1874#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {1790#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:18,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {1878#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1874#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-15 06:42:18,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {1882#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1878#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-15 06:42:18,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1886#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1882#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:18,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {1890#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~z~0 % 4294967296 > 0); {1886#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 06:42:18,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~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; {1890#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 06:42:18,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1898#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {1894#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:18,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1898#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} [87] 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[] {1898#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:20,599 WARN L290 TraceCheckUtils]: 6: Hoare triple {1905#(and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296))) (or (not (< 0 (mod main_~x~0 4294967296))) (and (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 1)) (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (> 0 aux_mod_aux_mod_v_main_~x~0_67_31_123) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))))) (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123) (* main_~n~0 2)) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (>= aux_mod_aux_mod_v_main_~x~0_67_31_123 4294967296))))))} [88] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_58 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_58 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_57 v_it_7 1) v_main_~x~0_58)) (not (<= 1 v_it_7)))) (< v_main_~x~0_57 v_main_~x~0_58) (= v_main_~y~0_39 (+ v_main_~x~0_58 v_main_~y~0_40 (* (- 1) v_main_~x~0_57)))) (and .cse1 (= v_main_~y~0_39 v_main_~y~0_40) (<= .cse0 0) .cse2 .cse3) (and .cse1 .cse2 (= v_main_~y~0_40 v_main_~y~0_39) .cse3))) InVars {main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_39, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1898#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-15 06:42:21,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1905#(and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296))) (or (not (< 0 (mod main_~x~0 4294967296))) (and (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 1)) (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (> 0 aux_mod_aux_mod_v_main_~x~0_67_31_123) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))))) (forall ((aux_div_aux_mod_v_main_~x~0_67_31_123 Int) (aux_mod_aux_mod_v_main_~x~0_67_31_123 Int) (aux_div_v_main_~y~0_47_46 Int) (aux_div_v_main_~x~0_67_31 Int)) (or (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (+ main_~y~0 main_~x~0 1)) (< (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)) (* aux_div_v_main_~y~0_47_46 4294967296)) (< (* aux_div_v_main_~y~0_47_46 4294967296) (+ 4294967294 aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< (+ main_~y~0 1) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296)))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123) (* main_~n~0 2)) (exists ((v_it_7 Int)) (and (<= (+ v_it_7 main_~y~0 2) (+ aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7))) (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_aux_mod_v_main_~x~0_67_31_123 (* aux_div_aux_mod_v_main_~x~0_67_31_123 4294967296))) (>= aux_mod_aux_mod_v_main_~x~0_67_31_123 4294967296))))))} is VALID [2022-04-15 06:42:21,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret13 := main(); {1778#true} is VALID [2022-04-15 06:42:21,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #72#return; {1778#true} is VALID [2022-04-15 06:42:21,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-15 06:42:21,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-15 06:42:21,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-15 06:42:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:21,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083559775] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:21,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:21,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-04-15 06:42:23,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:23,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915370359] [2022-04-15 06:42:23,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915370359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:23,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:23,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:42:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119343780] [2022-04-15 06:42:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:23,521 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 06:42:23,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:23,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 06:42:23,564 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 06:42:23,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:42:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:42:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=878, Unknown=31, NotChecked=0, Total=1056 [2022-04-15 06:42:23,565 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 06:42:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:35,331 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 06:42:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:42:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 06:42:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 06:42:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-15 06:42:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 06:42:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-15 06:42:35,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 35 transitions. [2022-04-15 06:42:35,492 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 06:42:35,492 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:42:35,492 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:42:35,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 104.7s TimeCoverageRelationStatistics Valid=205, Invalid=1402, Unknown=33, NotChecked=0, Total=1640 [2022-04-15 06:42:35,493 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:35,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2022-04-15 06:42:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:42:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-15 06:42:35,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:35,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:35,558 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:35,559 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:35,559 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 06:42:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 06:42:35,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:35,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:35,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:42:35,560 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:42:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:35,561 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 06:42:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 06:42:35,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:35,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:35,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:35,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-04-15 06:42:35,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 19 [2022-04-15 06:42:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:35,562 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-04-15 06:42:35,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 06:42:35,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 34 transitions. [2022-04-15 06:42:35,841 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 06:42:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-04-15 06:42:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:42:35,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:35,842 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:35,847 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 06:42:36,042 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 06:42:36,042 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-04-15 06:42:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:36,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377962259] [2022-04-15 06:42:36,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:42:36,257 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1108870161, now seen corresponding path program 1 times [2022-04-15 06:42:36,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:36,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075795718] [2022-04-15 06:42:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:36,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:36,267 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:42:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:36,283 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:42:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:36,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {2134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2127#true} is VALID [2022-04-15 06:42:36,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-15 06:42:36,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2127#true} {2127#true} #72#return; {2127#true} is VALID [2022-04-15 06:42:36,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:36,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {2134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2127#true} is VALID [2022-04-15 06:42:36,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-15 06:42:36,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #72#return; {2127#true} is VALID [2022-04-15 06:42:36,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret13 := main(); {2127#true} is VALID [2022-04-15 06:42:36,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {2127#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2127#true} is VALID [2022-04-15 06:42:36,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {2127#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_72 4294967296)) (.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse2 (= v_main_~x~0_72 v_main_~x~0_71)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_51 (+ v_main_~x~0_72 v_main_~y~0_52 (* (- 1) v_main_~x~0_71))) (< v_main_~x~0_71 v_main_~x~0_72) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_71 v_it_8 1) v_main_~x~0_72)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_72) 4294967296)) (not (<= 1 v_it_8))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2127#true} is VALID [2022-04-15 06:42:36,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {2127#true} [89] 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[] {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#(<= 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; {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2128#false} is VALID [2022-04-15 06:42:36,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {2128#false} assume !(~x~0 % 4294967296 > 0); {2128#false} is VALID [2022-04-15 06:42:36,330 INFO L272 TraceCheckUtils]: 16: Hoare triple {2128#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2128#false} is VALID [2022-04-15 06:42:36,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2022-04-15 06:42:36,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2022-04-15 06:42:36,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2022-04-15 06:42:36,331 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 06:42:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075795718] [2022-04-15 06:42:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075795718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914676513] [2022-04-15 06:42:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:36,333 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 06:42:36,334 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 06:42:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:36,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:42:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:36,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:36,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2127#true} is VALID [2022-04-15 06:42:36,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2127#true} is VALID [2022-04-15 06:42:36,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-15 06:42:36,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #72#return; {2127#true} is VALID [2022-04-15 06:42:36,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret13 := main(); {2127#true} is VALID [2022-04-15 06:42:36,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {2127#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2127#true} is VALID [2022-04-15 06:42:36,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {2127#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_72 4294967296)) (.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse2 (= v_main_~x~0_72 v_main_~x~0_71)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_51 (+ v_main_~x~0_72 v_main_~y~0_52 (* (- 1) v_main_~x~0_71))) (< v_main_~x~0_71 v_main_~x~0_72) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_71 v_it_8 1) v_main_~x~0_72)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_72) 4294967296)) (not (<= 1 v_it_8))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2127#true} is VALID [2022-04-15 06:42:36,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {2127#true} [89] 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[] {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#(<= 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; {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2128#false} is VALID [2022-04-15 06:42:36,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {2128#false} assume !(~x~0 % 4294967296 > 0); {2128#false} is VALID [2022-04-15 06:42:36,591 INFO L272 TraceCheckUtils]: 16: Hoare triple {2128#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2128#false} is VALID [2022-04-15 06:42:36,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2022-04-15 06:42:36,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2022-04-15 06:42:36,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2022-04-15 06:42:36,592 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 06:42:36,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:36,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2022-04-15 06:42:36,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2022-04-15 06:42:36,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2022-04-15 06:42:36,791 INFO L272 TraceCheckUtils]: 16: Hoare triple {2128#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2128#false} is VALID [2022-04-15 06:42:36,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {2128#false} assume !(~x~0 % 4294967296 > 0); {2128#false} is VALID [2022-04-15 06:42:36,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2128#false} is VALID [2022-04-15 06:42:36,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#(<= 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; {2133#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:36,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {2127#true} [89] 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[] {2132#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:36,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {2127#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_72 4294967296)) (.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse2 (= v_main_~x~0_72 v_main_~x~0_71)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_51 (+ v_main_~x~0_72 v_main_~y~0_52 (* (- 1) v_main_~x~0_71))) (< v_main_~x~0_71 v_main_~x~0_72) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_71 v_it_8 1) v_main_~x~0_72)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_72) 4294967296)) (not (<= 1 v_it_8))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2127#true} is VALID [2022-04-15 06:42:36,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {2127#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2127#true} is VALID [2022-04-15 06:42:36,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret13 := main(); {2127#true} is VALID [2022-04-15 06:42:36,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #72#return; {2127#true} is VALID [2022-04-15 06:42:36,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-15 06:42:36,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2127#true} is VALID [2022-04-15 06:42:36,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2127#true} is VALID [2022-04-15 06:42:36,795 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 06:42:36,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914676513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:36,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:36,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 06:42:36,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:36,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377962259] [2022-04-15 06:42:36,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377962259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:36,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:36,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:42:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657320227] [2022-04-15 06:42:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:36,864 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 06:42:36,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:36,864 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 06:42:36,879 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 06:42:36,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:42:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:36,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:42:36,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:42:36,880 INFO L87 Difference]: Start difference. First operand 27 states and 34 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 06:42:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:37,174 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 06:42:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:42:37,174 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 06:42:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:37,174 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 06:42:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 06:42:37,175 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 06:42:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 06:42:37,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 06:42:37,218 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 06:42:37,219 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:42:37,219 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:42:37,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:42:37,220 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:37,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 27 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:42:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:42:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 06:42:37,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:37,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 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 06:42:37,295 INFO L74 IsIncluded]: Start isIncluded. First operand 30 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 06:42:37,295 INFO L87 Difference]: Start difference. First operand 30 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 06:42:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:37,296 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 06:42:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 06:42:37,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:37,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:37,296 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 30 states. [2022-04-15 06:42:37,296 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 30 states. [2022-04-15 06:42:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:37,297 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 06:42:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 06:42:37,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:37,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:37,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:37,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:37,297 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 06:42:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-15 06:42:37,298 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 20 [2022-04-15 06:42:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:37,298 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-15 06:42:37,298 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 06:42:37,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-15 06:42:38,203 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 06:42:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 06:42:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:42:38,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:38,203 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:38,227 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 06:42:38,404 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 06:42:38,404 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash 633740065, now seen corresponding path program 3 times [2022-04-15 06:42:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:38,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806543125] [2022-04-15 06:42:40,533 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:40,642 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:42:40,643 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 48954306, now seen corresponding path program 1 times [2022-04-15 06:42:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847069608] [2022-04-15 06:42:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:40,652 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,662 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {2464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2455#true} is VALID [2022-04-15 06:42:40,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-15 06:42:40,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2455#true} {2455#true} #72#return; {2455#true} is VALID [2022-04-15 06:42:40,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:40,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {2464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2455#true} is VALID [2022-04-15 06:42:40,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-15 06:42:40,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #72#return; {2455#true} is VALID [2022-04-15 06:42:40,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret13 := main(); {2455#true} is VALID [2022-04-15 06:42:40,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {2455#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2455#true} is VALID [2022-04-15 06:42:40,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {2455#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_37| |v_main_#t~post6_36|)) (.cse0 (mod v_main_~x~0_85 4294967296)) (.cse2 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse3 (= |v_main_#t~post5_37| |v_main_#t~post5_36|))) (or (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_60 v_it_9 1) v_main_~y~0_59)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~x~0_84 (+ v_main_~x~0_85 v_main_~y~0_60 (* (- 1) v_main_~y~0_59))) (< v_main_~y~0_60 v_main_~y~0_59) (< 0 .cse0)) (and (= v_main_~y~0_60 v_main_~y~0_59) .cse1 .cse2 .cse3) (and (= v_main_~y~0_59 v_main_~y~0_60) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_37|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_37|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2455#true} is VALID [2022-04-15 06:42:40,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {2455#true} [91] 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[] {2455#true} is VALID [2022-04-15 06:42:40,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#true} ~z~0 := ~y~0; {2460#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:40,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {2460#(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; {2461#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:40,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {2461#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2462#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:40,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {2462#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {2463#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:40,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {2463#(<= 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; {2456#false} is VALID [2022-04-15 06:42:40,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {2456#false} assume !(~y~0 % 4294967296 > 0); {2456#false} is VALID [2022-04-15 06:42:40,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {2456#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2456#false} is VALID [2022-04-15 06:42:40,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#false} assume !(~x~0 % 4294967296 > 0); {2456#false} is VALID [2022-04-15 06:42:40,737 INFO L272 TraceCheckUtils]: 16: Hoare triple {2456#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2456#false} is VALID [2022-04-15 06:42:40,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2022-04-15 06:42:40,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2022-04-15 06:42:40,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-04-15 06:42:40,737 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 06:42:40,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:40,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847069608] [2022-04-15 06:42:40,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847069608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:40,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63152372] [2022-04-15 06:42:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:40,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:40,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:40,739 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 06:42:40,745 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 06:42:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:42:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:41,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2022-04-15 06:42:41,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2455#true} is VALID [2022-04-15 06:42:41,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-15 06:42:41,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #72#return; {2455#true} is VALID [2022-04-15 06:42:41,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret13 := main(); {2455#true} is VALID [2022-04-15 06:42:41,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {2455#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2455#true} is VALID [2022-04-15 06:42:41,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {2455#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_37| |v_main_#t~post6_36|)) (.cse0 (mod v_main_~x~0_85 4294967296)) (.cse2 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse3 (= |v_main_#t~post5_37| |v_main_#t~post5_36|))) (or (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_60 v_it_9 1) v_main_~y~0_59)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~x~0_84 (+ v_main_~x~0_85 v_main_~y~0_60 (* (- 1) v_main_~y~0_59))) (< v_main_~y~0_60 v_main_~y~0_59) (< 0 .cse0)) (and (= v_main_~y~0_60 v_main_~y~0_59) .cse1 .cse2 .cse3) (and (= v_main_~y~0_59 v_main_~y~0_60) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_37|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_37|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2455#true} is VALID [2022-04-15 06:42:41,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {2455#true} [91] 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[] {2455#true} is VALID [2022-04-15 06:42:41,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#true} ~z~0 := ~y~0; {2460#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:41,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {2460#(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; {2495#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:41,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {2495#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2462#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:41,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2462#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {2463#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:41,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {2463#(<= 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; {2456#false} is VALID [2022-04-15 06:42:41,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {2456#false} assume !(~y~0 % 4294967296 > 0); {2456#false} is VALID [2022-04-15 06:42:41,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {2456#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2456#false} is VALID [2022-04-15 06:42:41,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#false} assume !(~x~0 % 4294967296 > 0); {2456#false} is VALID [2022-04-15 06:42:41,103 INFO L272 TraceCheckUtils]: 16: Hoare triple {2456#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2456#false} is VALID [2022-04-15 06:42:41,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2022-04-15 06:42:41,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2022-04-15 06:42:41,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-04-15 06:42:41,103 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 06:42:41,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:41,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-04-15 06:42:41,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2022-04-15 06:42:41,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2022-04-15 06:42:41,399 INFO L272 TraceCheckUtils]: 16: Hoare triple {2456#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2456#false} is VALID [2022-04-15 06:42:41,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#false} assume !(~x~0 % 4294967296 > 0); {2456#false} is VALID [2022-04-15 06:42:41,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {2456#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2456#false} is VALID [2022-04-15 06:42:41,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {2456#false} assume !(~y~0 % 4294967296 > 0); {2456#false} is VALID [2022-04-15 06:42:41,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {2463#(<= 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; {2456#false} is VALID [2022-04-15 06:42:41,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {2462#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {2463#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:41,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {2553#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2462#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:41,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2553#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:42:41,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#true} ~z~0 := ~y~0; {2557#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:41,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {2455#true} [91] 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[] {2455#true} is VALID [2022-04-15 06:42:41,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {2455#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_37| |v_main_#t~post6_36|)) (.cse0 (mod v_main_~x~0_85 4294967296)) (.cse2 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse3 (= |v_main_#t~post5_37| |v_main_#t~post5_36|))) (or (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_60 v_it_9 1) v_main_~y~0_59)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~x~0_84 (+ v_main_~x~0_85 v_main_~y~0_60 (* (- 1) v_main_~y~0_59))) (< v_main_~y~0_60 v_main_~y~0_59) (< 0 .cse0)) (and (= v_main_~y~0_60 v_main_~y~0_59) .cse1 .cse2 .cse3) (and (= v_main_~y~0_59 v_main_~y~0_60) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_37|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_37|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2455#true} is VALID [2022-04-15 06:42:41,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {2455#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2455#true} is VALID [2022-04-15 06:42:41,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret13 := main(); {2455#true} is VALID [2022-04-15 06:42:41,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #72#return; {2455#true} is VALID [2022-04-15 06:42:41,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-15 06:42:41,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2455#true} is VALID [2022-04-15 06:42:41,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2022-04-15 06:42:41,405 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 06:42:41,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63152372] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:41,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:41,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 06:42:41,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:41,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806543125] [2022-04-15 06:42:41,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806543125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:41,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:41,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:42:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009098671] [2022-04-15 06:42:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:42:41,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:41,462 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 06:42:41,476 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 06:42:41,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:42:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:42:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:42:41,476 INFO L87 Difference]: Start difference. First operand 29 states and 36 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 06:42:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:41,914 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-15 06:42:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:42:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:42:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:41,915 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 06:42:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-15 06:42:41,916 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 06:42:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-15 06:42:41,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-15 06:42:41,960 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 06:42:41,961 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:42:41,961 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:42:41,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:42:41,962 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:41,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:42:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:42:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 06:42:42,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:42,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 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 06:42:42,063 INFO L74 IsIncluded]: Start isIncluded. First operand 35 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 06:42:42,063 INFO L87 Difference]: Start difference. First operand 35 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 06:42:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:42,064 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 06:42:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 06:42:42,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:42,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:42,064 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 35 states. [2022-04-15 06:42:42,064 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 35 states. [2022-04-15 06:42:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:42,065 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 06:42:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 06:42:42,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:42,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:42,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:42,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:42,065 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 06:42:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 06:42:42,066 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-04-15 06:42:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:42,066 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 06:42:42,066 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 06:42:42,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-15 06:42:42,316 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 06:42:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 06:42:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:42:42,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:42,317 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:42,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 06:42:42,527 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 06:42:42,527 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2032182702, now seen corresponding path program 4 times [2022-04-15 06:42:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1950719176] [2022-04-15 06:42:43,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:42:43,821 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash 80075571, now seen corresponding path program 1 times [2022-04-15 06:42:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:43,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273053843] [2022-04-15 06:42:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:43,831 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:43,839 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:43,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {2852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2843#true} is VALID [2022-04-15 06:42:43,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-15 06:42:43,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2843#true} {2843#true} #72#return; {2843#true} is VALID [2022-04-15 06:42:43,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {2843#true} call ULTIMATE.init(); {2852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:43,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {2852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2843#true} is VALID [2022-04-15 06:42:43,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-15 06:42:43,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2843#true} #72#return; {2843#true} is VALID [2022-04-15 06:42:43,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {2843#true} call #t~ret13 := main(); {2843#true} is VALID [2022-04-15 06:42:43,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {2843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2843#true} is VALID [2022-04-15 06:42:43,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_42| |v_main_#t~post6_41|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse4 (= |v_main_#t~post5_42| |v_main_#t~post5_41|))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_71 (* (- 1) v_main_~y~0_70))) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)) (not (<= (+ v_main_~y~0_71 v_it_10 1) v_main_~y~0_70)))) (< 0 .cse0) (< v_main_~y~0_71 v_main_~y~0_70)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_42|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2843#true} is VALID [2022-04-15 06:42:43,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#true} [93] 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[] {2848#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:43,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {2848#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2848#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:43,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {2848#(<= 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; {2849#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:43,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {2849#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:43,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:43,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:43,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:43,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {2850#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2851#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:42:43,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {2851#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2844#false} is VALID [2022-04-15 06:42:43,911 INFO L272 TraceCheckUtils]: 16: Hoare triple {2844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2844#false} is VALID [2022-04-15 06:42:43,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#false} ~cond := #in~cond; {2844#false} is VALID [2022-04-15 06:42:43,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {2844#false} assume 0 == ~cond; {2844#false} is VALID [2022-04-15 06:42:43,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {2844#false} assume !false; {2844#false} is VALID [2022-04-15 06:42:43,912 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 06:42:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:43,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273053843] [2022-04-15 06:42:43,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273053843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:43,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511129600] [2022-04-15 06:42:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:43,913 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 06:42:43,913 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 06:42:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:43,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:42:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:43,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:44,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {2843#true} call ULTIMATE.init(); {2843#true} is VALID [2022-04-15 06:42:44,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2843#true} is VALID [2022-04-15 06:42:44,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-15 06:42:44,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2843#true} #72#return; {2843#true} is VALID [2022-04-15 06:42:44,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {2843#true} call #t~ret13 := main(); {2843#true} is VALID [2022-04-15 06:42:44,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {2843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2843#true} is VALID [2022-04-15 06:42:44,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_42| |v_main_#t~post6_41|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse4 (= |v_main_#t~post5_42| |v_main_#t~post5_41|))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_71 (* (- 1) v_main_~y~0_70))) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)) (not (<= (+ v_main_~y~0_71 v_it_10 1) v_main_~y~0_70)))) (< 0 .cse0) (< v_main_~y~0_71 v_main_~y~0_70)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_42|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2843#true} is VALID [2022-04-15 06:42:44,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#true} [93] 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[] {2843#true} is VALID [2022-04-15 06:42:44,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {2843#true} ~z~0 := ~y~0; {2880#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:44,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {2880#(= 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; {2884#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:44,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#(= 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; {2888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:44,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {2888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:44,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {2888#(< 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; {2895#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:44,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {2895#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2844#false} is VALID [2022-04-15 06:42:44,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {2844#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2844#false} is VALID [2022-04-15 06:42:44,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {2844#false} assume !(~x~0 % 4294967296 > 0); {2844#false} is VALID [2022-04-15 06:42:44,038 INFO L272 TraceCheckUtils]: 16: Hoare triple {2844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2844#false} is VALID [2022-04-15 06:42:44,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#false} ~cond := #in~cond; {2844#false} is VALID [2022-04-15 06:42:44,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {2844#false} assume 0 == ~cond; {2844#false} is VALID [2022-04-15 06:42:44,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {2844#false} assume !false; {2844#false} is VALID [2022-04-15 06:42:44,038 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 06:42:44,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:44,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {2844#false} assume !false; {2844#false} is VALID [2022-04-15 06:42:44,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {2844#false} assume 0 == ~cond; {2844#false} is VALID [2022-04-15 06:42:44,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#false} ~cond := #in~cond; {2844#false} is VALID [2022-04-15 06:42:44,149 INFO L272 TraceCheckUtils]: 16: Hoare triple {2844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2844#false} is VALID [2022-04-15 06:42:44,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {2844#false} assume !(~x~0 % 4294967296 > 0); {2844#false} is VALID [2022-04-15 06:42:44,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {2844#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2844#false} is VALID [2022-04-15 06:42:44,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {2895#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2844#false} is VALID [2022-04-15 06:42:44,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {2888#(< 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; {2895#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:44,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {2888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:44,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {2944#(or (< 0 (mod (+ main_~y~0 4294967295) 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; {2888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:44,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {2948#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2944#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:42:44,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {2843#true} ~z~0 := ~y~0; {2948#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:44,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {2843#true} [93] 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[] {2843#true} is VALID [2022-04-15 06:42:44,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {2843#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_42| |v_main_#t~post6_41|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse4 (= |v_main_#t~post5_42| |v_main_#t~post5_41|))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_71 (* (- 1) v_main_~y~0_70))) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)) (not (<= (+ v_main_~y~0_71 v_it_10 1) v_main_~y~0_70)))) (< 0 .cse0) (< v_main_~y~0_71 v_main_~y~0_70)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_42|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2843#true} is VALID [2022-04-15 06:42:44,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {2843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2843#true} is VALID [2022-04-15 06:42:44,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {2843#true} call #t~ret13 := main(); {2843#true} is VALID [2022-04-15 06:42:44,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2843#true} {2843#true} #72#return; {2843#true} is VALID [2022-04-15 06:42:44,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#true} assume true; {2843#true} is VALID [2022-04-15 06:42:44,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2843#true} is VALID [2022-04-15 06:42:44,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {2843#true} call ULTIMATE.init(); {2843#true} is VALID [2022-04-15 06:42:44,154 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 06:42:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511129600] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:44,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:44,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-15 06:42:44,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:44,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1950719176] [2022-04-15 06:42:44,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1950719176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:44,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:44,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:42:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539348304] [2022-04-15 06:42:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:42:44,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:44,213 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 06:42:44,230 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 06:42:44,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:42:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:42:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:42:44,231 INFO L87 Difference]: Start difference. First operand 34 states and 42 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 06:42:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:44,720 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-15 06:42:44,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:42:44,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:42:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:44,720 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 06:42:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 06:42:44,721 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 06:42:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 06:42:44,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-15 06:42:44,778 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 06:42:44,778 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:42:44,778 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:42:44,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:42:44,779 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:44,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:42:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:42:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-15 06:42:44,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:44,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:44,925 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:44,925 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:44,926 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-15 06:42:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-15 06:42:44,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:44,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:44,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:42:44,927 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:42:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:44,928 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-15 06:42:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-04-15 06:42:44,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:44,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:44,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:44,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2022-04-15 06:42:44,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 20 [2022-04-15 06:42:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:44,930 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-04-15 06:42:44,930 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 06:42:44,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 58 transitions. [2022-04-15 06:42:45,370 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 06:42:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-15 06:42:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:42:45,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:45,371 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 06:42:45,387 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 06:42:45,575 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 06:42:45,575 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1461340774, now seen corresponding path program 5 times [2022-04-15 06:42:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:45,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2008943150] [2022-04-15 06:42:47,679 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:47,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:42:47,772 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 225856869, now seen corresponding path program 1 times [2022-04-15 06:42:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:47,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244405314] [2022-04-15 06:42:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:47,782 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:47,807 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:47,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {3306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3297#true} is VALID [2022-04-15 06:42:47,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {3297#true} assume true; {3297#true} is VALID [2022-04-15 06:42:47,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3297#true} {3297#true} #72#return; {3297#true} is VALID [2022-04-15 06:42:47,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {3297#true} call ULTIMATE.init(); {3306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:47,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {3306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3297#true} is VALID [2022-04-15 06:42:47,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {3297#true} assume true; {3297#true} is VALID [2022-04-15 06:42:47,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3297#true} {3297#true} #72#return; {3297#true} is VALID [2022-04-15 06:42:47,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {3297#true} call #t~ret13 := main(); {3297#true} is VALID [2022-04-15 06:42:47,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {3297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3297#true} is VALID [2022-04-15 06:42:47,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {3297#true} [96] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_104 v_main_~x~0_103)) (.cse2 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse3 (= |v_main_#t~post6_47| |v_main_#t~post6_46|)) (.cse0 (mod v_main_~x~0_104 4294967296))) (or (and (= v_main_~y~0_79 v_main_~y~0_80) (<= .cse0 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_80 v_main_~y~0_79) .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_103 v_it_11 1) v_main_~x~0_104)) (< 0 (mod (+ v_main_~x~0_104 (* 4294967295 v_it_11)) 4294967296)))) (= v_main_~y~0_79 (+ v_main_~x~0_104 v_main_~y~0_80 (* v_main_~x~0_103 (- 1)))) (< v_main_~x~0_103 v_main_~x~0_104) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_47|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_103, main_#t~post6=|v_main_#t~post6_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3297#true} is VALID [2022-04-15 06:42:47,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#true} [95] 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[] {3297#true} is VALID [2022-04-15 06:42:47,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {3297#true} ~z~0 := ~y~0; {3302#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:42:47,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {3302#(= (+ main_~z~0 (* (- 1) 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; {3303#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:47,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {3303#(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; {3304#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:47,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {3304#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3304#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:47,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {3304#(<= 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; {3305#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:47,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {3305#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {3298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {3298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {3298#false} assume !(~x~0 % 4294967296 > 0); {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L272 TraceCheckUtils]: 17: Hoare triple {3298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {3298#false} ~cond := #in~cond; {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {3298#false} assume 0 == ~cond; {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {3298#false} assume !false; {3298#false} is VALID [2022-04-15 06:42:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:47,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244405314] [2022-04-15 06:42:47,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244405314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415501721] [2022-04-15 06:42:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:47,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:47,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:47,880 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 06:42:47,881 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 06:42:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:47,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:42:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:47,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:48,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {3297#true} call ULTIMATE.init(); {3297#true} is VALID [2022-04-15 06:42:48,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {3297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3297#true} is VALID [2022-04-15 06:42:48,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {3297#true} assume true; {3297#true} is VALID [2022-04-15 06:42:48,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3297#true} {3297#true} #72#return; {3297#true} is VALID [2022-04-15 06:42:48,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {3297#true} call #t~ret13 := main(); {3297#true} is VALID [2022-04-15 06:42:48,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {3297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3297#true} is VALID [2022-04-15 06:42:48,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {3297#true} [96] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_104 v_main_~x~0_103)) (.cse2 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse3 (= |v_main_#t~post6_47| |v_main_#t~post6_46|)) (.cse0 (mod v_main_~x~0_104 4294967296))) (or (and (= v_main_~y~0_79 v_main_~y~0_80) (<= .cse0 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_80 v_main_~y~0_79) .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_103 v_it_11 1) v_main_~x~0_104)) (< 0 (mod (+ v_main_~x~0_104 (* 4294967295 v_it_11)) 4294967296)))) (= v_main_~y~0_79 (+ v_main_~x~0_104 v_main_~y~0_80 (* v_main_~x~0_103 (- 1)))) (< v_main_~x~0_103 v_main_~x~0_104) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_47|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_103, main_#t~post6=|v_main_#t~post6_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3297#true} is VALID [2022-04-15 06:42:48,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#true} [95] 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[] {3297#true} is VALID [2022-04-15 06:42:48,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {3297#true} ~z~0 := ~y~0; {3302#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:42:48,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {3302#(= (+ main_~z~0 (* (- 1) 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; {3303#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:48,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {3303#(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; {3340#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:48,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {3340#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3340#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:48,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {3340#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3347#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:48,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {3347#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {3298#false} is VALID [2022-04-15 06:42:48,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {3298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3298#false} is VALID [2022-04-15 06:42:48,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {3298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3298#false} is VALID [2022-04-15 06:42:48,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {3298#false} assume !(~x~0 % 4294967296 > 0); {3298#false} is VALID [2022-04-15 06:42:48,125 INFO L272 TraceCheckUtils]: 17: Hoare triple {3298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3298#false} is VALID [2022-04-15 06:42:48,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {3298#false} ~cond := #in~cond; {3298#false} is VALID [2022-04-15 06:42:48,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {3298#false} assume 0 == ~cond; {3298#false} is VALID [2022-04-15 06:42:48,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {3298#false} assume !false; {3298#false} is VALID [2022-04-15 06:42:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:48,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:48,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {3298#false} assume !false; {3298#false} is VALID [2022-04-15 06:42:48,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {3298#false} assume 0 == ~cond; {3298#false} is VALID [2022-04-15 06:42:48,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {3298#false} ~cond := #in~cond; {3298#false} is VALID [2022-04-15 06:42:48,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {3298#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3298#false} is VALID [2022-04-15 06:42:48,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {3298#false} assume !(~x~0 % 4294967296 > 0); {3298#false} is VALID [2022-04-15 06:42:48,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {3298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3298#false} is VALID [2022-04-15 06:42:48,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {3298#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3298#false} is VALID [2022-04-15 06:42:48,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {3305#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3298#false} is VALID [2022-04-15 06:42:48,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {3304#(<= 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; {3305#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:48,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {3304#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3304#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:48,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {3402#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3304#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:48,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {3406#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3402#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 06:42:48,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {3297#true} ~z~0 := ~y~0; {3406#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 06:42:48,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {3297#true} [95] 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[] {3297#true} is VALID [2022-04-15 06:42:48,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {3297#true} [96] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_104 v_main_~x~0_103)) (.cse2 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse3 (= |v_main_#t~post6_47| |v_main_#t~post6_46|)) (.cse0 (mod v_main_~x~0_104 4294967296))) (or (and (= v_main_~y~0_79 v_main_~y~0_80) (<= .cse0 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_80 v_main_~y~0_79) .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_103 v_it_11 1) v_main_~x~0_104)) (< 0 (mod (+ v_main_~x~0_104 (* 4294967295 v_it_11)) 4294967296)))) (= v_main_~y~0_79 (+ v_main_~x~0_104 v_main_~y~0_80 (* v_main_~x~0_103 (- 1)))) (< v_main_~x~0_103 v_main_~x~0_104) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_47|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_103, main_#t~post6=|v_main_#t~post6_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3297#true} is VALID [2022-04-15 06:42:48,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {3297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3297#true} is VALID [2022-04-15 06:42:48,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {3297#true} call #t~ret13 := main(); {3297#true} is VALID [2022-04-15 06:42:48,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3297#true} {3297#true} #72#return; {3297#true} is VALID [2022-04-15 06:42:48,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {3297#true} assume true; {3297#true} is VALID [2022-04-15 06:42:48,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {3297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3297#true} is VALID [2022-04-15 06:42:48,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {3297#true} call ULTIMATE.init(); {3297#true} is VALID [2022-04-15 06:42:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:48,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415501721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:48,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:48,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-15 06:42:48,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:48,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2008943150] [2022-04-15 06:42:48,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2008943150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:48,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:48,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:42:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439367245] [2022-04-15 06:42:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:48,405 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 06:42:48,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:48,405 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 06:42:48,425 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 06:42:48,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:42:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:48,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:42:48,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:42:48,426 INFO L87 Difference]: Start difference. First operand 45 states and 58 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 06:42:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:48,952 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-15 06:42:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:42:48,952 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 06:42:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:48,952 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 06:42:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 06:42:48,953 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 06:42:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 06:42:48,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-15 06:42:48,984 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 06:42:48,984 INFO L225 Difference]: With dead ends: 59 [2022-04-15 06:42:48,984 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:42:48,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:42:48,985 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:48,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:42:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:42:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 06:42:49,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:49,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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 06:42:49,087 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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 06:42:49,087 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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 06:42:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:49,088 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 06:42:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 06:42:49,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:49,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:49,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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 36 states. [2022-04-15 06:42:49,088 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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 36 states. [2022-04-15 06:42:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:49,089 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 06:42:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 06:42:49,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:49,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:49,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:49,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 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 06:42:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-15 06:42:49,090 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 21 [2022-04-15 06:42:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:49,090 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-15 06:42:49,090 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 06:42:49,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 43 transitions. [2022-04-15 06:42:49,366 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 06:42:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-15 06:42:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:42:49,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:49,367 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:49,383 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 06:42:49,579 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 06:42:49,581 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:49,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 6 times [2022-04-15 06:42:49,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:49,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345132731] [2022-04-15 06:42:49,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:42:49,749 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash -61480798, now seen corresponding path program 1 times [2022-04-15 06:42:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:49,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525727663] [2022-04-15 06:42:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:49,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:49,757 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,787 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:50,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:50,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3713#true} is VALID [2022-04-15 06:42:50,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {3713#true} assume true; {3713#true} is VALID [2022-04-15 06:42:50,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3713#true} {3713#true} #72#return; {3713#true} is VALID [2022-04-15 06:42:50,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {3713#true} call ULTIMATE.init(); {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:50,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3713#true} is VALID [2022-04-15 06:42:50,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {3713#true} assume true; {3713#true} is VALID [2022-04-15 06:42:50,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3713#true} {3713#true} #72#return; {3713#true} is VALID [2022-04-15 06:42:50,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {3713#true} call #t~ret13 := main(); {3713#true} is VALID [2022-04-15 06:42:50,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {3713#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3718#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:42:50,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {3718#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_52| |v_main_#t~post6_51|)) (.cse1 (= |v_main_#t~post5_52| |v_main_#t~post5_51|)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= v_main_~y~0_89 v_main_~y~0_88)) (.cse4 (mod v_main_~x~0_115 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_115 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_114 v_it_12 1) v_main_~x~0_115)) (not (<= 1 v_it_12)))) (< v_main_~x~0_114 v_main_~x~0_115) (= v_main_~y~0_88 (+ v_main_~x~0_115 (* v_main_~x~0_114 (- 1)) v_main_~y~0_89)) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_52|} OutVars{main_~y~0=v_main_~y~0_88, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3719#(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 06:42:50,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {3719#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3720#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 06:42:50,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {3720#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {3721#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-15 06:42:50,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {3721#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~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; {3722#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= (+ (* (div (+ main_~z~0 1) 4294967296) 2147483648) main_~n~0) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 2147483648) 1)))} is VALID [2022-04-15 06:42:50,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {3722#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= (+ (* (div (+ main_~z~0 1) 4294967296) 2147483648) main_~n~0) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 2147483648) 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; {3723#(<= (+ (* (div (+ 2147483645 main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 2147483648)) 2147483648) 4294967296) main_~z~0 4) (* main_~n~0 2))} is VALID [2022-04-15 06:42:50,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {3723#(<= (+ (* (div (+ 2147483645 main_~n~0 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 2147483648)) 2147483648) 4294967296) main_~z~0 4) (* main_~n~0 2))} assume !(~z~0 % 4294967296 > 0); {3724#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648) 4294967296) 4))} is VALID [2022-04-15 06:42:50,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {3724#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648) 4294967296) 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3725#(<= (* main_~n~0 2) (+ main_~z~0 3 (* 4294967296 (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 1) main_~n~0) 2147483648))))} is VALID [2022-04-15 06:42:50,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {3725#(<= (* main_~n~0 2) (+ main_~z~0 3 (* 4294967296 (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 1) main_~n~0) 2147483648))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3726#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} is VALID [2022-04-15 06:42:50,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {3726#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3726#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} is VALID [2022-04-15 06:42:50,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {3726#(<= (* main_~n~0 2) (+ main_~z~0 2 (* (div (+ (- 1) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3727#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648) 4294967296) 1))} is VALID [2022-04-15 06:42:50,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {3727#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (- 1) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:50,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:50,352 INFO L272 TraceCheckUtils]: 18: Hoare triple {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3729#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:42:50,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {3729#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3730#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:42:50,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {3730#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3714#false} is VALID [2022-04-15 06:42:50,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {3714#false} assume !false; {3714#false} is VALID [2022-04-15 06:42:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:50,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:50,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525727663] [2022-04-15 06:42:50,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525727663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:50,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814559574] [2022-04-15 06:42:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:50,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:50,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:50,354 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 06:42:50,355 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 06:42:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:54,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 06:42:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:55,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:34,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {3713#true} call ULTIMATE.init(); {3713#true} is VALID [2022-04-15 06:43:34,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {3713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3713#true} is VALID [2022-04-15 06:43:34,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3713#true} assume true; {3713#true} is VALID [2022-04-15 06:43:34,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3713#true} {3713#true} #72#return; {3713#true} is VALID [2022-04-15 06:43:34,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {3713#true} call #t~ret13 := main(); {3713#true} is VALID [2022-04-15 06:43:34,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {3713#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3718#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:43:34,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {3718#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_52| |v_main_#t~post6_51|)) (.cse1 (= |v_main_#t~post5_52| |v_main_#t~post5_51|)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= v_main_~y~0_89 v_main_~y~0_88)) (.cse4 (mod v_main_~x~0_115 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_115 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_114 v_it_12 1) v_main_~x~0_115)) (not (<= 1 v_it_12)))) (< v_main_~x~0_114 v_main_~x~0_115) (= v_main_~y~0_88 (+ v_main_~x~0_115 (* v_main_~x~0_114 (- 1)) v_main_~y~0_89)) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_52|} OutVars{main_~y~0=v_main_~y~0_88, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3753#(or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 06:43:34,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#(or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3757#(and (or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 06:43:34,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {3757#(and (or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {3761#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 1) main_~x~0))))))} is VALID [2022-04-15 06:43:34,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12 1) main_~n~0)) (not (<= 1 v_it_12)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 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; {3765#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} is VALID [2022-04-15 06:43:34,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {3765#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ 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; {3769#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296))) (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} is VALID [2022-04-15 06:43:34,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296))) (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {3773#(and (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 06:43:34,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {3773#(and (< 0 (+ main_~z~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= v_it_12 (+ main_~z~0 1))) (not (<= 1 v_it_12)))) (<= (mod (+ main_~n~0 4294967294 (* main_~z~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~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; {3777#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} is VALID [2022-04-15 06:43:34,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {3777#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3781#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} is VALID [2022-04-15 06:43:34,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {3781#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} assume !(~y~0 % 4294967296 > 0); {3781#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} is VALID [2022-04-15 06:43:34,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {3781#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ (- 1) main_~z~0)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) (+ main_~n~0 1))) (not (<= 1 v_it_12)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3788#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 06:43:34,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {3788#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_12) main_~n~0)) (not (<= 1 v_it_12)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3792#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 06:43:34,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {3792#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {3792#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 06:43:36,949 WARN L272 TraceCheckUtils]: 18: Hoare triple {3792#(and (forall ((v_it_12 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_12) main_~n~0) 4294967296)) (not (<= (+ 3 v_it_12) main_~z~0)) (not (<= 1 v_it_12)))) (< 2 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3799#(exists ((aux_mod_v_main_~z~0_BEFORE_CALL_2_57 Int) (aux_div_v_main_~z~0_BEFORE_CALL_2_57 Int) (aux_mod_v_main_~n~0_BEFORE_CALL_2_89 Int)) (and (< 4294967294 (+ (* aux_div_v_main_~z~0_BEFORE_CALL_2_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_2_57)) (<= aux_mod_v_main_~n~0_BEFORE_CALL_2_89 0) (<= 1 |__VERIFIER_assert_#in~cond|) (<= aux_mod_v_main_~z~0_BEFORE_CALL_2_57 0) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_2_89) (<= 0 aux_mod_v_main_~z~0_BEFORE_CALL_2_57) (forall ((v_it_12 Int)) (or (< 0 (mod (+ aux_mod_v_main_~n~0_BEFORE_CALL_2_89 (* 4294967295 v_it_12) 2 aux_mod_v_main_~z~0_BEFORE_CALL_2_57) 4294967296)) (not (<= (+ 4294967295 v_it_12) (+ (* aux_div_v_main_~z~0_BEFORE_CALL_2_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_2_57))) (not (<= 1 v_it_12))))))} is UNKNOWN [2022-04-15 06:43:36,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {3799#(exists ((aux_mod_v_main_~z~0_BEFORE_CALL_2_57 Int) (aux_div_v_main_~z~0_BEFORE_CALL_2_57 Int) (aux_mod_v_main_~n~0_BEFORE_CALL_2_89 Int)) (and (< 4294967294 (+ (* aux_div_v_main_~z~0_BEFORE_CALL_2_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_2_57)) (<= aux_mod_v_main_~n~0_BEFORE_CALL_2_89 0) (<= 1 |__VERIFIER_assert_#in~cond|) (<= aux_mod_v_main_~z~0_BEFORE_CALL_2_57 0) (<= 0 aux_mod_v_main_~n~0_BEFORE_CALL_2_89) (<= 0 aux_mod_v_main_~z~0_BEFORE_CALL_2_57) (forall ((v_it_12 Int)) (or (< 0 (mod (+ aux_mod_v_main_~n~0_BEFORE_CALL_2_89 (* 4294967295 v_it_12) 2 aux_mod_v_main_~z~0_BEFORE_CALL_2_57) 4294967296)) (not (<= (+ 4294967295 v_it_12) (+ (* aux_div_v_main_~z~0_BEFORE_CALL_2_57 4294967296) aux_mod_v_main_~z~0_BEFORE_CALL_2_57))) (not (<= 1 v_it_12))))))} ~cond := #in~cond; {3803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:43:36,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {3803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3714#false} is VALID [2022-04-15 06:43:36,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {3714#false} assume !false; {3714#false} is VALID [2022-04-15 06:43:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:36,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:01,958 WARN L232 SmtUtils]: Spent 42.73s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 06:46:05,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {3714#false} assume !false; {3714#false} is VALID [2022-04-15 06:46:05,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {3803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3714#false} is VALID [2022-04-15 06:46:05,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {3816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:46:05,388 INFO L272 TraceCheckUtils]: 18: Hoare triple {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:46:05,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:46:05,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {3826#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3728#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:46:05,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3826#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 06:46:05,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~y~0 % 4294967296 > 0); {3830#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 06:46:05,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {3837#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (not (< 0 (mod (+ 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; {3830#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 06:46:05,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {3841#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3837#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:46:05,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {3845#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} assume !(~z~0 % 4294967296 > 0); {3841#(or (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-15 06:46:05,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {3849#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3845#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-15 06:46:05,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {3853#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~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; {3849#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (<= (mod main_~x~0 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:46:05,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} ~z~0 := ~y~0; {3853#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 06:46:05,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {3861#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3857#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} is VALID [2022-04-15 06:46:07,424 WARN L290 TraceCheckUtils]: 6: Hoare triple {3865#(and (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (> 0 aux_mod_aux_mod_v_main_~x~0_127_32_125) (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125 1)) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)))) (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (>= aux_mod_aux_mod_v_main_~x~0_127_32_125 4294967296) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* main_~n~0 2))))) (not (< 0 (mod main_~x~0 4294967296)))))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_52| |v_main_#t~post6_51|)) (.cse1 (= |v_main_#t~post5_52| |v_main_#t~post5_51|)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= v_main_~y~0_89 v_main_~y~0_88)) (.cse4 (mod v_main_~x~0_115 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_115 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_114 v_it_12 1) v_main_~x~0_115)) (not (<= 1 v_it_12)))) (< v_main_~x~0_114 v_main_~x~0_115) (= v_main_~y~0_88 (+ v_main_~x~0_115 (* v_main_~x~0_114 (- 1)) v_main_~y~0_89)) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_52|} OutVars{main_~y~0=v_main_~y~0_88, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3861#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-15 06:46:07,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {3713#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3865#(and (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (> 0 aux_mod_aux_mod_v_main_~x~0_127_32_125) (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125 1)) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)))) (forall ((aux_div_aux_mod_v_main_~x~0_127_32_125 Int) (aux_div_v_main_~y~0_96_46 Int) (aux_div_v_main_~x~0_127_32 Int) (aux_mod_aux_mod_v_main_~x~0_127_32_125 Int)) (or (< (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* aux_div_v_main_~y~0_96_46 4294967296)) (not (< (+ main_~y~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125))) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32)) (+ main_~y~0 main_~x~0 2)) (exists ((v_it_12 Int)) (and (<= (+ main_~y~0 3 v_it_12) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= 1 v_it_12) (not (< 0 (mod (+ (* 4294967295 v_it_12) main_~x~0) 4294967296))))) (< (+ main_~y~0 main_~x~0 2) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125 (* 4294967296 aux_div_v_main_~x~0_127_32))) (>= aux_mod_aux_mod_v_main_~x~0_127_32_125 4294967296) (< (* aux_div_v_main_~y~0_96_46 4294967296) (+ 4294967292 (* 4294967296 aux_div_aux_mod_v_main_~x~0_127_32_125) aux_mod_aux_mod_v_main_~x~0_127_32_125)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_127_32_125) (* main_~n~0 2))))) (not (< 0 (mod main_~x~0 4294967296)))))} is VALID [2022-04-15 06:46:07,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {3713#true} call #t~ret13 := main(); {3713#true} is VALID [2022-04-15 06:46:07,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3713#true} {3713#true} #72#return; {3713#true} is VALID [2022-04-15 06:46:07,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {3713#true} assume true; {3713#true} is VALID [2022-04-15 06:46:07,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {3713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3713#true} is VALID [2022-04-15 06:46:07,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {3713#true} call ULTIMATE.init(); {3713#true} is VALID [2022-04-15 06:46:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:46:07,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814559574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:07,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:07,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 39 [2022-04-15 06:46:16,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:16,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345132731] [2022-04-15 06:46:16,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345132731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:16,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:16,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:46:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190963745] [2022-04-15 06:46:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:46:16,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:16,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 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 06:46:16,442 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 06:46:16,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:46:16,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:16,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:46:16,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1416, Unknown=45, NotChecked=0, Total=1640 [2022-04-15 06:46:16,443 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 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 06:46:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:22,176 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-15 06:46:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:46:22,176 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:46:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 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 06:46:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-15 06:46:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 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 06:46:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-15 06:46:22,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 41 transitions. [2022-04-15 06:46:22,342 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 06:46:22,342 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:46:22,343 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:46:22,343 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 181.0s TimeCoverageRelationStatistics Valid=251, Invalid=2354, Unknown=47, NotChecked=0, Total=2652 [2022-04-15 06:46:22,344 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:22,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 65 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2022-04-15 06:46:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:46:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-15 06:46:22,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:22,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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 06:46:22,465 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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 06:46:22,465 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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 06:46:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:22,466 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-15 06:46:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-15 06:46:22,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:22,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:22,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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 41 states. [2022-04-15 06:46:22,466 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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 41 states. [2022-04-15 06:46:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:22,467 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-15 06:46:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-15 06:46:22,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:22,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:22,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:22,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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 06:46:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-15 06:46:22,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 23 [2022-04-15 06:46:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:22,468 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-15 06:46:22,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 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 06:46:22,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-15 06:46:24,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-15 06:46:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:46:24,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:24,783 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:24,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 06:46:24,984 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 06:46:24,984 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1748448584, now seen corresponding path program 7 times [2022-04-15 06:46:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:24,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755767181] [2022-04-15 06:46:25,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:46:25,260 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1431334722, now seen corresponding path program 1 times [2022-04-15 06:46:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:25,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890980378] [2022-04-15 06:46:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:25,269 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,279 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:25,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {4172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4162#true} is VALID [2022-04-15 06:46:25,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {4162#true} assume true; {4162#true} is VALID [2022-04-15 06:46:25,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4162#true} {4162#true} #72#return; {4162#true} is VALID [2022-04-15 06:46:25,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {4162#true} call ULTIMATE.init(); {4172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:25,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {4172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4162#true} is VALID [2022-04-15 06:46:25,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {4162#true} assume true; {4162#true} is VALID [2022-04-15 06:46:25,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4162#true} {4162#true} #72#return; {4162#true} is VALID [2022-04-15 06:46:25,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {4162#true} call #t~ret13 := main(); {4162#true} is VALID [2022-04-15 06:46:25,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {4162#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4162#true} is VALID [2022-04-15 06:46:25,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {4162#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_133 4294967296)) (.cse0 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_102 v_it_13 1) v_main_~y~0_101)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse4) (= v_main_~x~0_132 (+ v_main_~x~0_133 (* (- 1) v_main_~y~0_101) v_main_~y~0_102)) (< v_main_~y~0_102 v_main_~y~0_101)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4162#true} is VALID [2022-04-15 06:46:25,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {4162#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4167#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:25,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {4167#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4167#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:25,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {4167#(<= 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; {4168#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:25,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {4168#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4169#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:25,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {4169#(<= 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; {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:25,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:25,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:25,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:25,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:25,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {4170#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4171#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:46:25,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {4171#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4163#false} is VALID [2022-04-15 06:46:25,362 INFO L272 TraceCheckUtils]: 18: Hoare triple {4163#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4163#false} is VALID [2022-04-15 06:46:25,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {4163#false} ~cond := #in~cond; {4163#false} is VALID [2022-04-15 06:46:25,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {4163#false} assume 0 == ~cond; {4163#false} is VALID [2022-04-15 06:46:25,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {4163#false} assume !false; {4163#false} is VALID [2022-04-15 06:46:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:46:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:25,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890980378] [2022-04-15 06:46:25,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890980378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:25,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251143865] [2022-04-15 06:46:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:25,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:25,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:25,364 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 06:46:25,365 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 06:46:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:46:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:25,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {4162#true} call ULTIMATE.init(); {4162#true} is VALID [2022-04-15 06:46:25,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {4162#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4162#true} is VALID [2022-04-15 06:46:25,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {4162#true} assume true; {4162#true} is VALID [2022-04-15 06:46:25,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4162#true} {4162#true} #72#return; {4162#true} is VALID [2022-04-15 06:46:25,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {4162#true} call #t~ret13 := main(); {4162#true} is VALID [2022-04-15 06:46:25,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {4162#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4162#true} is VALID [2022-04-15 06:46:25,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {4162#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_133 4294967296)) (.cse0 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_102 v_it_13 1) v_main_~y~0_101)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse4) (= v_main_~x~0_132 (+ v_main_~x~0_133 (* (- 1) v_main_~y~0_101) v_main_~y~0_102)) (< v_main_~y~0_102 v_main_~y~0_101)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4162#true} is VALID [2022-04-15 06:46:25,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {4162#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4162#true} is VALID [2022-04-15 06:46:25,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {4162#true} ~z~0 := ~y~0; {4200#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:46:25,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {4200#(= 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; {4204#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:46:25,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#(= 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; {4208#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:46:25,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {4208#(= 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; {4212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:25,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {4212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:25,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {4212#(< 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; {4219#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:25,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {4219#(< 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; {4223#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:25,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4163#false} is VALID [2022-04-15 06:46:25,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {4163#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4163#false} is VALID [2022-04-15 06:46:25,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {4163#false} assume !(~x~0 % 4294967296 > 0); {4163#false} is VALID [2022-04-15 06:46:25,524 INFO L272 TraceCheckUtils]: 18: Hoare triple {4163#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4163#false} is VALID [2022-04-15 06:46:25,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {4163#false} ~cond := #in~cond; {4163#false} is VALID [2022-04-15 06:46:25,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {4163#false} assume 0 == ~cond; {4163#false} is VALID [2022-04-15 06:46:25,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {4163#false} assume !false; {4163#false} is VALID [2022-04-15 06:46:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:46:25,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:25,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {4163#false} assume !false; {4163#false} is VALID [2022-04-15 06:46:25,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {4163#false} assume 0 == ~cond; {4163#false} is VALID [2022-04-15 06:46:25,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {4163#false} ~cond := #in~cond; {4163#false} is VALID [2022-04-15 06:46:25,693 INFO L272 TraceCheckUtils]: 18: Hoare triple {4163#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4163#false} is VALID [2022-04-15 06:46:25,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {4163#false} assume !(~x~0 % 4294967296 > 0); {4163#false} is VALID [2022-04-15 06:46:25,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {4163#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4163#false} is VALID [2022-04-15 06:46:25,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4163#false} is VALID [2022-04-15 06:46:25,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {4219#(< 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; {4223#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:25,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {4212#(< 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; {4219#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:25,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {4212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:25,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {4275#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {4212#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:25,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {4279#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {4275#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:46:25,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {4283#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4279#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:46:25,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {4162#true} ~z~0 := ~y~0; {4283#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:46:25,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {4162#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {4162#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_133 4294967296)) (.cse0 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_102 v_it_13 1) v_main_~y~0_101)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse4) (= v_main_~x~0_132 (+ v_main_~x~0_133 (* (- 1) v_main_~y~0_101) v_main_~y~0_102)) (< v_main_~y~0_102 v_main_~y~0_101)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {4162#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {4162#true} call #t~ret13 := main(); {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4162#true} {4162#true} #72#return; {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {4162#true} assume true; {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {4162#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {4162#true} call ULTIMATE.init(); {4162#true} is VALID [2022-04-15 06:46:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:46:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251143865] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:25,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:25,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-04-15 06:46:25,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:25,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755767181] [2022-04-15 06:46:25,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755767181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:25,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:25,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:46:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777747569] [2022-04-15 06:46:25,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:25,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:46:25,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:25,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:25,827 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 06:46:25,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:46:25,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:25,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:46:25,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:46:25,829 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:26,639 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-15 06:46:26,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:46:26,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:46:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-15 06:46:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-15 06:46:26,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2022-04-15 06:46:26,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:26,708 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:46:26,708 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 06:46:26,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:46:26,709 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:26,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 35 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:46:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 06:46:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-04-15 06:46:26,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:26,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,841 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,842 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:26,843 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 06:46:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 06:46:26,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:26,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:26,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:46:26,843 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:46:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:26,844 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 06:46:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 06:46:26,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:26,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:26,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:26,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-15 06:46:26,845 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 23 [2022-04-15 06:46:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:26,845 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-15 06:46:26,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:26,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 53 transitions. [2022-04-15 06:46:27,528 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 06:46:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-15 06:46:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:46:27,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:27,529 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:27,544 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 06:46:27,729 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 06:46:27,729 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash -476532785, now seen corresponding path program 8 times [2022-04-15 06:46:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:27,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501924276] [2022-04-15 06:46:27,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:46:27,907 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash 998052933, now seen corresponding path program 1 times [2022-04-15 06:46:27,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:27,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625025194] [2022-04-15 06:46:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:27,916 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:27,926 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:28,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:28,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {4660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4649#true} is VALID [2022-04-15 06:46:28,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {4649#true} assume true; {4649#true} is VALID [2022-04-15 06:46:28,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4649#true} {4649#true} #72#return; {4649#true} is VALID [2022-04-15 06:46:28,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {4649#true} call ULTIMATE.init(); {4660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:28,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4649#true} is VALID [2022-04-15 06:46:28,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4649#true} assume true; {4649#true} is VALID [2022-04-15 06:46:28,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4649#true} {4649#true} #72#return; {4649#true} is VALID [2022-04-15 06:46:28,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {4649#true} call #t~ret13 := main(); {4649#true} is VALID [2022-04-15 06:46:28,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {4649#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4649#true} is VALID [2022-04-15 06:46:28,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {4649#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_145 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse1 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse2 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse3 (= v_main_~y~0_114 v_main_~y~0_113))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_114 (* (- 1) v_main_~y~0_113))) (< v_main_~y~0_114 v_main_~y~0_113) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_114 v_it_14 1) v_main_~y~0_113)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_114, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_113, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4649#true} is VALID [2022-04-15 06:46:28,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {4649#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4649#true} is VALID [2022-04-15 06:46:28,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {4649#true} ~z~0 := ~y~0; {4654#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:46:28,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {4654#(= (+ 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; {4655#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:28,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {4655#(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; {4656#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:28,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {4656#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4657#(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 06:46:28,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {4657#(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; {4658#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:46:28,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {4658#(<= 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; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:46:28,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {4659#(<= 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; {4650#false} is VALID [2022-04-15 06:46:28,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {4650#false} assume !(~y~0 % 4294967296 > 0); {4650#false} is VALID [2022-04-15 06:46:28,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {4650#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4650#false} is VALID [2022-04-15 06:46:28,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {4650#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4650#false} is VALID [2022-04-15 06:46:28,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {4650#false} assume !(~x~0 % 4294967296 > 0); {4650#false} is VALID [2022-04-15 06:46:28,063 INFO L272 TraceCheckUtils]: 19: Hoare triple {4650#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4650#false} is VALID [2022-04-15 06:46:28,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {4650#false} ~cond := #in~cond; {4650#false} is VALID [2022-04-15 06:46:28,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {4650#false} assume 0 == ~cond; {4650#false} is VALID [2022-04-15 06:46:28,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {4650#false} assume !false; {4650#false} is VALID [2022-04-15 06:46:28,064 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 06:46:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:28,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625025194] [2022-04-15 06:46:28,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625025194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:28,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919579384] [2022-04-15 06:46:28,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:28,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:28,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:28,065 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 06:46:28,067 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 06:46:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:28,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:46:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:28,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:28,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {4649#true} call ULTIMATE.init(); {4649#true} is VALID [2022-04-15 06:46:28,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {4649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4649#true} is VALID [2022-04-15 06:46:28,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {4649#true} assume true; {4649#true} is VALID [2022-04-15 06:46:28,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4649#true} {4649#true} #72#return; {4649#true} is VALID [2022-04-15 06:46:28,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {4649#true} call #t~ret13 := main(); {4649#true} is VALID [2022-04-15 06:46:28,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {4649#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4649#true} is VALID [2022-04-15 06:46:28,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {4649#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_145 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse1 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse2 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse3 (= v_main_~y~0_114 v_main_~y~0_113))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_114 (* (- 1) v_main_~y~0_113))) (< v_main_~y~0_114 v_main_~y~0_113) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_114 v_it_14 1) v_main_~y~0_113)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_114, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_113, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4649#true} is VALID [2022-04-15 06:46:28,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {4649#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4649#true} is VALID [2022-04-15 06:46:28,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {4649#true} ~z~0 := ~y~0; {4654#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:46:28,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {4654#(= (+ 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; {4655#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:28,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {4655#(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; {4656#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:28,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {4656#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4697#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 06:46:28,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {4697#(<= (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; {4658#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:46:28,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {4658#(<= 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; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {4659#(<= 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; {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {4650#false} assume !(~y~0 % 4294967296 > 0); {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {4650#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {4650#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {4650#false} assume !(~x~0 % 4294967296 > 0); {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L272 TraceCheckUtils]: 19: Hoare triple {4650#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {4650#false} ~cond := #in~cond; {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {4650#false} assume 0 == ~cond; {4650#false} is VALID [2022-04-15 06:46:28,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {4650#false} assume !false; {4650#false} is VALID [2022-04-15 06:46:28,453 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 06:46:28,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:28,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {4650#false} assume !false; {4650#false} is VALID [2022-04-15 06:46:28,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {4650#false} assume 0 == ~cond; {4650#false} is VALID [2022-04-15 06:46:28,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {4650#false} ~cond := #in~cond; {4650#false} is VALID [2022-04-15 06:46:28,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {4650#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4650#false} is VALID [2022-04-15 06:46:28,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {4650#false} assume !(~x~0 % 4294967296 > 0); {4650#false} is VALID [2022-04-15 06:46:28,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {4650#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4650#false} is VALID [2022-04-15 06:46:28,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {4650#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4650#false} is VALID [2022-04-15 06:46:28,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {4650#false} assume !(~y~0 % 4294967296 > 0); {4650#false} is VALID [2022-04-15 06:46:28,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {4659#(<= 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; {4650#false} is VALID [2022-04-15 06:46:28,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {4658#(<= 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; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:46:28,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {4697#(<= (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; {4658#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:46:28,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {4764#(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); {4697#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 06:46:28,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {4768#(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; {4764#(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 06:46:28,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {4772#(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; {4768#(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 06:46:28,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {4649#true} ~z~0 := ~y~0; {4772#(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 06:46:28,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {4649#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4649#true} is VALID [2022-04-15 06:46:28,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {4649#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_145 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse1 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse2 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse3 (= v_main_~y~0_114 v_main_~y~0_113))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_114 (* (- 1) v_main_~y~0_113))) (< v_main_~y~0_114 v_main_~y~0_113) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_114 v_it_14 1) v_main_~y~0_113)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_114, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_113, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4649#true} is VALID [2022-04-15 06:46:28,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {4649#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4649#true} is VALID [2022-04-15 06:46:28,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {4649#true} call #t~ret13 := main(); {4649#true} is VALID [2022-04-15 06:46:28,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4649#true} {4649#true} #72#return; {4649#true} is VALID [2022-04-15 06:46:28,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {4649#true} assume true; {4649#true} is VALID [2022-04-15 06:46:28,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {4649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4649#true} is VALID [2022-04-15 06:46:28,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {4649#true} call ULTIMATE.init(); {4649#true} is VALID [2022-04-15 06:46:28,890 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 06:46:28,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919579384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:28,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:28,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-15 06:46:28,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:28,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [501924276] [2022-04-15 06:46:28,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [501924276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:28,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:28,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:46:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369679245] [2022-04-15 06:46:28,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:28,965 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 24 [2022-04-15 06:46:28,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:28,965 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 06:46:28,983 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 06:46:28,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:46:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:46:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:46:28,984 INFO L87 Difference]: Start difference. First operand 42 states and 53 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 06:46:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:29,738 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-15 06:46:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:46:29,738 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 24 [2022-04-15 06:46:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:29,738 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 06:46:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 06:46:29,739 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 06:46:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 06:46:29,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-15 06:46:29,780 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 06:46:29,781 INFO L225 Difference]: With dead ends: 52 [2022-04-15 06:46:29,781 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:46:29,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:46:29,781 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:29,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:46:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:46:29,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-04-15 06:46:29,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:29,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:29,902 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:29,902 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:29,903 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-15 06:46:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-15 06:46:29,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:29,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:29,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 06:46:29,904 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 06:46:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:29,904 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-15 06:46:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-15 06:46:29,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:29,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:29,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:29,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-15 06:46:29,905 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2022-04-15 06:46:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:29,905 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-15 06:46:29,905 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 06:46:29,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-15 06:46:30,778 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 06:46:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 06:46:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:46:30,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:30,778 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:30,794 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 06:46:30,979 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 06:46:30,979 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1165944096, now seen corresponding path program 9 times [2022-04-15 06:46:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:30,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034682415] [2022-04-15 06:46:33,087 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:46:33,169 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:46:33,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 31113558, now seen corresponding path program 1 times [2022-04-15 06:46:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:33,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217762838] [2022-04-15 06:46:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:33,181 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:33,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:33,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:33,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {5097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5086#true} is VALID [2022-04-15 06:46:33,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-15 06:46:33,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5086#true} {5086#true} #72#return; {5086#true} is VALID [2022-04-15 06:46:33,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {5086#true} call ULTIMATE.init(); {5097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:33,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {5097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5086#true} is VALID [2022-04-15 06:46:33,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-15 06:46:33,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5086#true} #72#return; {5086#true} is VALID [2022-04-15 06:46:33,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#true} call #t~ret13 := main(); {5086#true} is VALID [2022-04-15 06:46:33,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {5086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5086#true} is VALID [2022-04-15 06:46:33,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_128 v_main_~y~0_127)) (.cse2 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse3 (= v_main_~x~0_157 v_main_~x~0_156)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|)) (.cse0 (mod v_main_~x~0_157 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_128 v_main_~y~0_127) (= v_main_~x~0_156 (+ v_main_~x~0_157 v_main_~y~0_128 (* (- 1) v_main_~y~0_127))) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_157 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_128 v_it_15 1) v_main_~y~0_127)) (not (<= 1 v_it_15))))))) InVars {main_~y~0=v_main_~y~0_128, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_156, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5086#true} is VALID [2022-04-15 06:46:33,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5091#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:33,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {5091#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5091#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:33,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {5091#(<= 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; {5092#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:33,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {5092#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5093#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {5093#(<= 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; {5094#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {5094#(<= 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; {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {5095#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5096#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:46:33,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {5096#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5087#false} is VALID [2022-04-15 06:46:33,284 INFO L272 TraceCheckUtils]: 19: Hoare triple {5087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5087#false} is VALID [2022-04-15 06:46:33,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {5087#false} ~cond := #in~cond; {5087#false} is VALID [2022-04-15 06:46:33,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {5087#false} assume 0 == ~cond; {5087#false} is VALID [2022-04-15 06:46:33,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-04-15 06:46:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:46:33,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217762838] [2022-04-15 06:46:33,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217762838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:33,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332590015] [2022-04-15 06:46:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:33,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:33,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:33,286 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 06:46:33,286 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 06:46:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:33,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:46:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:33,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:33,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {5086#true} call ULTIMATE.init(); {5086#true} is VALID [2022-04-15 06:46:33,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5086#true} is VALID [2022-04-15 06:46:33,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-15 06:46:33,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5086#true} #72#return; {5086#true} is VALID [2022-04-15 06:46:33,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#true} call #t~ret13 := main(); {5086#true} is VALID [2022-04-15 06:46:33,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {5086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5086#true} is VALID [2022-04-15 06:46:33,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_128 v_main_~y~0_127)) (.cse2 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse3 (= v_main_~x~0_157 v_main_~x~0_156)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|)) (.cse0 (mod v_main_~x~0_157 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_128 v_main_~y~0_127) (= v_main_~x~0_156 (+ v_main_~x~0_157 v_main_~y~0_128 (* (- 1) v_main_~y~0_127))) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_157 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_128 v_it_15 1) v_main_~y~0_127)) (not (<= 1 v_it_15))))))) InVars {main_~y~0=v_main_~y~0_128, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_156, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5086#true} is VALID [2022-04-15 06:46:33,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5086#true} is VALID [2022-04-15 06:46:33,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {5086#true} ~z~0 := ~y~0; {5125#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:46:33,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {5125#(= 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; {5129#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:46:33,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {5129#(= 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; {5133#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:46:33,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {5133#(= 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; {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:33,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {5137#(< 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; {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:33,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:33,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {5137#(< 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; {5147#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:33,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {5147#(< 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; {5151#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:33,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {5151#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5087#false} is VALID [2022-04-15 06:46:33,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {5087#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5087#false} is VALID [2022-04-15 06:46:33,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {5087#false} assume !(~x~0 % 4294967296 > 0); {5087#false} is VALID [2022-04-15 06:46:33,467 INFO L272 TraceCheckUtils]: 19: Hoare triple {5087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5087#false} is VALID [2022-04-15 06:46:33,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {5087#false} ~cond := #in~cond; {5087#false} is VALID [2022-04-15 06:46:33,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {5087#false} assume 0 == ~cond; {5087#false} is VALID [2022-04-15 06:46:33,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-04-15 06:46:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:46:33,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:33,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-04-15 06:46:33,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {5087#false} assume 0 == ~cond; {5087#false} is VALID [2022-04-15 06:46:33,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {5087#false} ~cond := #in~cond; {5087#false} is VALID [2022-04-15 06:46:33,624 INFO L272 TraceCheckUtils]: 19: Hoare triple {5087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5087#false} is VALID [2022-04-15 06:46:33,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {5087#false} assume !(~x~0 % 4294967296 > 0); {5087#false} is VALID [2022-04-15 06:46:33,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {5087#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5087#false} is VALID [2022-04-15 06:46:33,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {5151#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5087#false} is VALID [2022-04-15 06:46:33,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {5147#(< 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; {5151#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:33,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {5137#(< 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; {5147#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:33,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:33,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {5137#(< 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; {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:33,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {5206#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {5137#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:46:33,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {5210#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {5206#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:46:33,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {5214#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5210#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:46:33,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {5086#true} ~z~0 := ~y~0; {5214#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:46:33,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5086#true} is VALID [2022-04-15 06:46:33,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_128 v_main_~y~0_127)) (.cse2 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse3 (= v_main_~x~0_157 v_main_~x~0_156)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|)) (.cse0 (mod v_main_~x~0_157 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_128 v_main_~y~0_127) (= v_main_~x~0_156 (+ v_main_~x~0_157 v_main_~y~0_128 (* (- 1) v_main_~y~0_127))) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_157 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_128 v_it_15 1) v_main_~y~0_127)) (not (<= 1 v_it_15))))))) InVars {main_~y~0=v_main_~y~0_128, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_156, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5086#true} is VALID [2022-04-15 06:46:33,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {5086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5086#true} is VALID [2022-04-15 06:46:33,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#true} call #t~ret13 := main(); {5086#true} is VALID [2022-04-15 06:46:33,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5086#true} #72#return; {5086#true} is VALID [2022-04-15 06:46:33,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-04-15 06:46:33,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5086#true} is VALID [2022-04-15 06:46:33,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {5086#true} call ULTIMATE.init(); {5086#true} is VALID [2022-04-15 06:46:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:46:33,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332590015] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:33,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:33,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:46:33,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:33,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034682415] [2022-04-15 06:46:33,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034682415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:33,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:33,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:46:33,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992118364] [2022-04-15 06:46:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:33,737 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 24 [2022-04-15 06:46:33,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:33,737 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 06:46:33,755 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 06:46:33,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:46:33,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:46:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:46:33,756 INFO L87 Difference]: Start difference. First operand 38 states and 47 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 06:46:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:34,759 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-15 06:46:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:46:34,759 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 24 [2022-04-15 06:46:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:34,759 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 06:46:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-04-15 06:46:34,760 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 06:46:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-04-15 06:46:34,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 67 transitions. [2022-04-15 06:46:34,845 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 06:46:34,846 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:46:34,846 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:46:34,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:46:34,847 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:34,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 35 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:46:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:46:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2022-04-15 06:46:34,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:34,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:34,989 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:34,989 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:34,990 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-15 06:46:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-04-15 06:46:34,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:34,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:34,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:46:34,991 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:46:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:34,991 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-15 06:46:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-04-15 06:46:34,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:34,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:34,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:34,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-04-15 06:46:34,995 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 24 [2022-04-15 06:46:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:34,995 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-04-15 06:46:34,996 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 06:46:34,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 54 transitions. [2022-04-15 06:46:37,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 06:46:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:46:37,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:37,403 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:37,422 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 06:46:37,622 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 06:46:37,622 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash 176966584, now seen corresponding path program 10 times [2022-04-15 06:46:37,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:37,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060494404] [2022-04-15 06:46:39,003 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:46:39,005 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:39,006 INFO L85 PathProgramCache]: Analyzing trace with hash 69432962, now seen corresponding path program 1 times [2022-04-15 06:46:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:39,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001474142] [2022-04-15 06:46:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:39,021 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:39,031 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:39,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {5603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5592#true} is VALID [2022-04-15 06:46:39,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {5592#true} assume true; {5592#true} is VALID [2022-04-15 06:46:39,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5592#true} {5592#true} #72#return; {5592#true} is VALID [2022-04-15 06:46:39,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {5592#true} call ULTIMATE.init(); {5603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:39,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5592#true} is VALID [2022-04-15 06:46:39,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {5592#true} assume true; {5592#true} is VALID [2022-04-15 06:46:39,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5592#true} {5592#true} #72#return; {5592#true} is VALID [2022-04-15 06:46:39,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {5592#true} call #t~ret13 := main(); {5592#true} is VALID [2022-04-15 06:46:39,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {5592#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5592#true} is VALID [2022-04-15 06:46:39,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {5592#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse1 (mod v_main_~x~0_170 4294967296))) (or (and .cse0 (= v_main_~y~0_139 v_main_~y~0_140) (= v_main_~x~0_169 v_main_~x~0_170) (<= .cse1 0) .cse2) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169) (= v_main_~y~0_140 v_main_~y~0_139) .cse2) (and (< 0 .cse1) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_170 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_169 v_it_16 1) v_main_~x~0_170)))) (< v_main_~x~0_169 v_main_~x~0_170) (= v_main_~y~0_139 (+ v_main_~x~0_170 v_main_~y~0_140 (* v_main_~x~0_169 (- 1))))))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_170, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_169, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5592#true} is VALID [2022-04-15 06:46:39,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {5592#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5592#true} is VALID [2022-04-15 06:46:39,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {5592#true} ~z~0 := ~y~0; {5597#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:46:39,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {5597#(= (+ main_~z~0 (* (- 1) 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; {5598#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:39,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {5598#(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; {5599#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:39,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {5599#(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; {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:39,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:39,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {5600#(<= 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; {5601#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:46:39,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {5601#(<= 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; {5602#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:46:39,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {5602#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5593#false} is VALID [2022-04-15 06:46:39,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {5593#false} assume !(~x~0 % 4294967296 > 0); {5593#false} is VALID [2022-04-15 06:46:39,121 INFO L272 TraceCheckUtils]: 20: Hoare triple {5593#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5593#false} is VALID [2022-04-15 06:46:39,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {5593#false} ~cond := #in~cond; {5593#false} is VALID [2022-04-15 06:46:39,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {5593#false} assume 0 == ~cond; {5593#false} is VALID [2022-04-15 06:46:39,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {5593#false} assume !false; {5593#false} is VALID [2022-04-15 06:46:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:46:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:39,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001474142] [2022-04-15 06:46:39,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001474142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:39,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889442448] [2022-04-15 06:46:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:39,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:39,122 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 06:46:39,123 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 06:46:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:39,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:46:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:39,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:39,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {5592#true} call ULTIMATE.init(); {5592#true} is VALID [2022-04-15 06:46:39,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {5592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5592#true} is VALID [2022-04-15 06:46:39,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {5592#true} assume true; {5592#true} is VALID [2022-04-15 06:46:39,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5592#true} {5592#true} #72#return; {5592#true} is VALID [2022-04-15 06:46:39,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {5592#true} call #t~ret13 := main(); {5592#true} is VALID [2022-04-15 06:46:39,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {5592#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5592#true} is VALID [2022-04-15 06:46:39,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {5592#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse1 (mod v_main_~x~0_170 4294967296))) (or (and .cse0 (= v_main_~y~0_139 v_main_~y~0_140) (= v_main_~x~0_169 v_main_~x~0_170) (<= .cse1 0) .cse2) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169) (= v_main_~y~0_140 v_main_~y~0_139) .cse2) (and (< 0 .cse1) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_170 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_169 v_it_16 1) v_main_~x~0_170)))) (< v_main_~x~0_169 v_main_~x~0_170) (= v_main_~y~0_139 (+ v_main_~x~0_170 v_main_~y~0_140 (* v_main_~x~0_169 (- 1))))))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_170, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_169, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5592#true} is VALID [2022-04-15 06:46:39,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {5592#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5592#true} is VALID [2022-04-15 06:46:39,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {5592#true} ~z~0 := ~y~0; {5597#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:46:39,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {5597#(= (+ main_~z~0 (* (- 1) 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; {5598#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:39,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {5598#(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; {5599#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:39,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {5599#(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; {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:39,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:39,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {5600#(<= 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; {5601#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:46:39,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {5601#(<= 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; {5602#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {5602#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {5593#false} assume !(~x~0 % 4294967296 > 0); {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L272 TraceCheckUtils]: 20: Hoare triple {5593#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {5593#false} ~cond := #in~cond; {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {5593#false} assume 0 == ~cond; {5593#false} is VALID [2022-04-15 06:46:39,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {5593#false} assume !false; {5593#false} is VALID [2022-04-15 06:46:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:46:39,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:39,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {5593#false} assume !false; {5593#false} is VALID [2022-04-15 06:46:39,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {5593#false} assume 0 == ~cond; {5593#false} is VALID [2022-04-15 06:46:39,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {5593#false} ~cond := #in~cond; {5593#false} is VALID [2022-04-15 06:46:39,773 INFO L272 TraceCheckUtils]: 20: Hoare triple {5593#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5593#false} is VALID [2022-04-15 06:46:39,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {5593#false} assume !(~x~0 % 4294967296 > 0); {5593#false} is VALID [2022-04-15 06:46:39,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {5593#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5593#false} is VALID [2022-04-15 06:46:39,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {5602#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5593#false} is VALID [2022-04-15 06:46:39,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {5601#(<= 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; {5602#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:46:39,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {5600#(<= 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; {5601#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:46:39,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:39,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {5712#(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; {5600#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:46:39,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {5716#(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; {5712#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:46:39,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {5720#(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; {5716#(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 06:46:39,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {5592#true} ~z~0 := ~y~0; {5720#(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 06:46:39,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {5592#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5592#true} is VALID [2022-04-15 06:46:39,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {5592#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse1 (mod v_main_~x~0_170 4294967296))) (or (and .cse0 (= v_main_~y~0_139 v_main_~y~0_140) (= v_main_~x~0_169 v_main_~x~0_170) (<= .cse1 0) .cse2) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169) (= v_main_~y~0_140 v_main_~y~0_139) .cse2) (and (< 0 .cse1) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_170 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_169 v_it_16 1) v_main_~x~0_170)))) (< v_main_~x~0_169 v_main_~x~0_170) (= v_main_~y~0_139 (+ v_main_~x~0_170 v_main_~y~0_140 (* v_main_~x~0_169 (- 1))))))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_170, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_169, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5592#true} is VALID [2022-04-15 06:46:39,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {5592#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5592#true} is VALID [2022-04-15 06:46:39,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {5592#true} call #t~ret13 := main(); {5592#true} is VALID [2022-04-15 06:46:39,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5592#true} {5592#true} #72#return; {5592#true} is VALID [2022-04-15 06:46:39,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {5592#true} assume true; {5592#true} is VALID [2022-04-15 06:46:39,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {5592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5592#true} is VALID [2022-04-15 06:46:39,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {5592#true} call ULTIMATE.init(); {5592#true} is VALID [2022-04-15 06:46:39,781 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 06:46:39,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889442448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:39,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:39,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 06:46:39,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:39,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060494404] [2022-04-15 06:46:39,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060494404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:39,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:39,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:46:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972418609] [2022-04-15 06:46:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:39,863 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 06:46:39,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:39,864 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 06:46:39,881 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 06:46:39,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:46:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:39,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:46:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:46:39,882 INFO L87 Difference]: Start difference. First operand 43 states and 54 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 06:46:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:40,836 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-15 06:46:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:46:40,836 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 06:46:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:40,836 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 06:46:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2022-04-15 06:46:40,837 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 06:46:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2022-04-15 06:46:40,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 38 transitions. [2022-04-15 06:46:40,884 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 06:46:40,885 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:46:40,885 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:46:40,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:46:40,885 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:40,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:46:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:46:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-04-15 06:46:41,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:41,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:41,059 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:41,059 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:41,060 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-15 06:46:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-15 06:46:41,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:41,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:41,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:46:41,061 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:46:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:41,061 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-15 06:46:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-15 06:46:41,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:41,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:41,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:41,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-15 06:46:41,062 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 25 [2022-04-15 06:46:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:41,062 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-15 06:46:41,063 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 06:46:41,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-15 06:46:43,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-15 06:46:43,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:46:43,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:43,551 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:43,567 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 06:46:43,767 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 06:46:43,767 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:43,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1440430863, now seen corresponding path program 11 times [2022-04-15 06:46:43,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:43,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029367920] [2022-04-15 06:46:43,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:46:43,984 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 132872999, now seen corresponding path program 1 times [2022-04-15 06:46:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:43,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772940705] [2022-04-15 06:46:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:43,993 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:44,022 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.8))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:44,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {6119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6098#true} is VALID [2022-04-15 06:46:44,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {6098#true} assume true; {6098#true} is VALID [2022-04-15 06:46:44,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6098#true} {6098#true} #72#return; {6098#true} is VALID [2022-04-15 06:46:44,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {6098#true} call ULTIMATE.init(); {6119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:44,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {6119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6098#true} is VALID [2022-04-15 06:46:44,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#true} assume true; {6098#true} is VALID [2022-04-15 06:46:44,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6098#true} {6098#true} #72#return; {6098#true} is VALID [2022-04-15 06:46:44,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {6098#true} call #t~ret13 := main(); {6098#true} is VALID [2022-04-15 06:46:44,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {6098#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6103#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:46:44,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {6103#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [108] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_184 4294967296)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_184 v_main_~x~0_183))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_184 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_152 v_it_17 1) v_main_~y~0_151)) (not (<= 1 v_it_17)))) (= v_main_~x~0_183 (+ v_main_~x~0_184 v_main_~y~0_152 (* (- 1) v_main_~y~0_151))) (< 0 .cse2) (< v_main_~y~0_152 v_main_~y~0_151)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_152, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_184, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_151, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_183, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6104#(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 06:46:44,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {6104#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6105#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 06:46:44,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {6105#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {6106#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-15 06:46:44,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {6106#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~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; {6107#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ (* (div (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-15 06:46:44,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {6107#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ (* (div (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6108#(or (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ 4294967293 (* (div (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:46:45,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {6108#(or (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0) (= main_~y~0 0)) (<= main_~z~0 (+ 4294967293 (* (div (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) 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; {6109#(or (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0) (= main_~y~0 0)) (<= (* (div (+ main_~n~0 (* (- 1) main_~z~0) 2147483644 (* (div main_~z~0 4294967296) 4294967296) (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648) 4294967296) main_~z~0))} is VALID [2022-04-15 06:46:45,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {6109#(or (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0) (= main_~y~0 0)) (<= (* (div (+ main_~n~0 (* (- 1) main_~z~0) 2147483644 (* (div main_~z~0 4294967296) 4294967296) (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6110#(<= (* 4294967296 (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648)) main_~z~0)} is VALID [2022-04-15 06:46:45,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {6110#(<= (* 4294967296 (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 3) 2))) 2147483648))) 2147483648)) 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; {6111#(<= (+ (* 4294967296 (div (+ (* (- 2147483648) (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 2) main_~n~0) 2147483648)) main_~n~0 2147483644) 2147483648)) 1) main_~z~0)} is VALID [2022-04-15 06:46:45,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {6111#(<= (+ (* 4294967296 (div (+ (* (- 2147483648) (div (+ (* (- 1) (div (+ main_~z~0 2) 2)) (- 2) main_~n~0) 2147483648)) main_~n~0 2147483644) 2147483648)) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6112#(<= (+ 2 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648))) 2147483648) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:45,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {6112#(<= (+ 2 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ main_~z~0 1) 2))) 2147483648))) 2147483648) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6113#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:45,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {6113#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {6113#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:45,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {6113#(<= (+ 3 (* (div (+ main_~n~0 2147483644 (* (- 2147483648) (div (+ (- 2) (* (- 1) (div main_~z~0 2)) main_~n~0) 2147483648))) 2147483648) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6114#(<= (+ (* (div (+ main_~n~0 (* (- 2147483648) (div (+ (* (- 1) (div (+ (- 1) main_~z~0) 2)) (- 2) main_~n~0) 2147483648)) 2147483644) 2147483648) 4294967296) 4) main_~z~0)} is VALID [2022-04-15 06:46:45,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {6114#(<= (+ (* (div (+ main_~n~0 (* (- 2147483648) (div (+ (* (- 1) (div (+ (- 1) main_~z~0) 2)) (- 2) main_~n~0) 2147483648)) 2147483644) 2147483648) 4294967296) 4) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6115#(<= (+ 5 (* 4294967296 (div (+ (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ (- 2) main_~z~0) 2))) 2147483648)) main_~n~0 2147483644) 2147483648))) main_~z~0)} is VALID [2022-04-15 06:46:45,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {6115#(<= (+ 5 (* 4294967296 (div (+ (* (- 2147483648) (div (+ (- 2) main_~n~0 (* (- 1) (div (+ (- 2) main_~z~0) 2))) 2147483648)) main_~n~0 2147483644) 2147483648))) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6116#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:46:45,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {6116#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {6116#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:46:45,084 INFO L272 TraceCheckUtils]: 21: Hoare triple {6116#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6117#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:46:45,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {6117#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6118#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:46:45,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {6118#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6099#false} is VALID [2022-04-15 06:46:45,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {6099#false} assume !false; {6099#false} is VALID [2022-04-15 06:46:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:46:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772940705] [2022-04-15 06:46:45,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772940705] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:45,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785764922] [2022-04-15 06:46:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:45,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:45,086 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 06:46:45,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process