/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-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:41:03,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:41:03,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:41:03,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:41:03,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:41:03,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:41:03,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:41:03,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:41:03,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:41:03,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:41:03,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:41:03,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:41:03,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:41:03,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:41:03,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:41:03,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:41:03,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:41:03,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:41:03,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:41:03,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:41:03,206 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:41:03,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:41:03,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:41:03,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:41:03,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:41:03,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:41:03,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:41:03,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:41:03,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:41:03,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:41:03,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:41:03,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:41:03,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:41:03,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:41:03,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:41:03,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:41:03,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:41:03,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:41:03,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:41:03,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:41:03,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:41:03,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:41:03,227 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:41:03,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:41:03,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:41:03,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:41:03,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:41:03,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:41:03,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:41:03,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:41:03,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:41:03,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:41:03,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:41:03,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:41:03,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:41:03,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:41:03,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:41:03,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:41:03,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:41:03,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:41:03,239 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:41:03,239 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:41:03,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:41:03,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:41:03,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:41:03,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:41:03,477 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:41:03,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-15 06:41:03,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecaba86d7/0ac7229574214fd1887cf851a43d55cb/FLAG57ba7e3ca [2022-04-15 06:41:03,870 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:41:03,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-15 06:41:03,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecaba86d7/0ac7229574214fd1887cf851a43d55cb/FLAG57ba7e3ca [2022-04-15 06:41:03,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecaba86d7/0ac7229574214fd1887cf851a43d55cb [2022-04-15 06:41:03,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:41:03,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:41:03,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:41:03,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:41:03,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:41:03,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:41:03" (1/1) ... [2022-04-15 06:41:03,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fee5fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:03, skipping insertion in model container [2022-04-15 06:41:03,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:41:03" (1/1) ... [2022-04-15 06:41:03,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:41:03,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:41:04,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-04-15 06:41:04,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:41:04,080 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:41:04,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-04-15 06:41:04,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:41:04,112 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:41:04,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04 WrapperNode [2022-04-15 06:41:04,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:41:04,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:41:04,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:41:04,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:41:04,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:41:04,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:41:04,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:41:04,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:41:04,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (1/1) ... [2022-04-15 06:41:04,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:41:04,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:04,186 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:41:04,203 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:41:04,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:41:04,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:41:04,212 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:41:04,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:41:04,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:41:04,212 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:41:04,212 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:41:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:41:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:41:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:41:04,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:41:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:41:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:41:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:41:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:41:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:41:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:41:04,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:41:04,260 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:41:04,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:41:04,432 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:41:04,436 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:41:04,436 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 06:41:04,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:41:04 BoogieIcfgContainer [2022-04-15 06:41:04,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:41:04,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:41:04,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:41:04,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:41:04,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:41:03" (1/3) ... [2022-04-15 06:41:04,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18016c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:41:04, skipping insertion in model container [2022-04-15 06:41:04,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:04" (2/3) ... [2022-04-15 06:41:04,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18016c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:41:04, skipping insertion in model container [2022-04-15 06:41:04,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:41:04" (3/3) ... [2022-04-15 06:41:04,442 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.c [2022-04-15 06:41:04,445 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:41:04,445 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:41:04,470 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:41:04,476 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:41:04,476 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:41:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:41:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:41:04,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:04,495 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:41:04,495 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:04,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-15 06:41:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:04,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043228118] [2022-04-15 06:41:04,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:41:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-15 06:41:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:04,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187213113] [2022-04-15 06:41:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:04,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 06:41:04,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:41:04,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 06:41:04,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:04,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 06:41:04,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:41:04,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 06:41:04,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-15 06:41:04,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-15 06:41:04,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 06:41:04,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-15 06:41:04,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 06:41:04,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 06:41:04,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 06:41:04,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 06:41:04,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 06:41:04,699 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-15 06:41:04,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 06:41:04,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 06:41:04,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 06:41:04,701 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:41:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187213113] [2022-04-15 06:41:04,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187213113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:04,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:04,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:41:04,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:04,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043228118] [2022-04-15 06:41:04,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043228118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:04,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:04,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:41:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142707687] [2022-04-15 06:41:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:04,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:41:04,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:04,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,735 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:41:04,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:41:04,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:04,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:41:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:41:04,754 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:04,843 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-15 06:41:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:41:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:41:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 06:41:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 06:41:04,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-15 06:41:04,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:04,930 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:41:04,930 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:41:04,931 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:41:04,934 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:04,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:41:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:41:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:41:04,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:04,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,953 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,954 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:04,956 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 06:41:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 06:41:04,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:04,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:04,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:41:04,956 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:41:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:04,958 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 06:41:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 06:41:04,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:04,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:04,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:04,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-15 06:41:04,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-15 06:41:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:04,962 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-15 06:41:04,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:04,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-15 06:41:04,982 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:41:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 06:41:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:41:04,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:04,983 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:41:04,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:41:04,983 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-15 06:41:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:04,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001932118] [2022-04-15 06:41:04,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:41:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-15 06:41:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:04,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134474862] [2022-04-15 06:41:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:05,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-15 06:41:05,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 06:41:05,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 06:41:05,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:05,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-15 06:41:05,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 06:41:05,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 06:41:05,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-15 06:41:05,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:41:05,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 06:41:05,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {200#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:41:05,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:41:05,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:41:05,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:41:05,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:41:05,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:41:05,272 INFO L272 TraceCheckUtils]: 13: Hoare triple {202#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {203#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:41:05,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {203#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:41:05,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-15 06:41:05,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 06:41:05,274 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:41:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:05,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134474862] [2022-04-15 06:41:05,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134474862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:05,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:05,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:05,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:05,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001932118] [2022-04-15 06:41:05,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001932118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:05,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:05,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670481871] [2022-04-15 06:41:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:41:05,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:05,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,291 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:41:05,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:05,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:05,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:41:05,292 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:05,613 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-15 06:41:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:41:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:41:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 06:41:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 06:41:05,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-15 06:41:05,668 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:41:05,669 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:41:05,669 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 06:41:05,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:41:05,670 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:05,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 46 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 06:41:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 06:41:05,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:05,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,674 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,674 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:05,676 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 06:41:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 06:41:05,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:05,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:05,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:41:05,677 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 06:41:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:05,678 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 06:41:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 06:41:05,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:05,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:05,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:05,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-15 06:41:05,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-04-15 06:41:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:05,680 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-15 06:41:05,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:05,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-15 06:41:05,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 06:41:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:41:05,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:05,700 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:41:05,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:41:05,700 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash -121895178, now seen corresponding path program 1 times [2022-04-15 06:41:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:05,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205013061] [2022-04-15 06:41:05,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:41:05,998 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -994530153, now seen corresponding path program 1 times [2022-04-15 06:41:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:06,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478432523] [2022-04-15 06:41:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:06,014 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:06,042 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:06,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-15 06:41:06,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-15 06:41:06,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-15 06:41:06,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:06,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {370#true} is VALID [2022-04-15 06:41:06,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-15 06:41:06,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #94#return; {370#true} is VALID [2022-04-15 06:41:06,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret17 := main(); {370#true} is VALID [2022-04-15 06:41:06,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:41:06,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_13 4294967296)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~x~0_13 v_main_~x~0_12)) (.cse4 (= v_main_~y~0_14 v_main_~y~0_13))) (or (and (< 0 .cse0) (< v_main_~x~0_12 v_main_~x~0_13) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_13 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_12 v_it_1 1) v_main_~x~0_13)) (not (<= 1 v_it_1)))) (= v_main_~y~0_13 (+ v_main_~x~0_13 v_main_~y~0_14 (* (- 1) v_main_~x~0_12)))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_14, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_13, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_13, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_12, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {376#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-15 06:41:06,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {377#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:06,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {378#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:41:06,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:06,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:06,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:06,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:06,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:06,202 INFO L272 TraceCheckUtils]: 14: Hoare triple {379#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {380#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:41:06,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {380#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {381#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:41:06,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {381#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {371#false} is VALID [2022-04-15 06:41:06,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-15 06:41:06,203 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:41:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478432523] [2022-04-15 06:41:06,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478432523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:06,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:06,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:41:06,498 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:06,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205013061] [2022-04-15 06:41:06,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205013061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:06,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:06,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:41:06,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820229877] [2022-04-15 06:41:06,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:06,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 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:41:06,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:06,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 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:41:06,518 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:41:06,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:41:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:41:06,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:41:06,519 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 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:41:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:07,012 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-04-15 06:41:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:41:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 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:41:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 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:41:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-15 06:41:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 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:41:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-15 06:41:07,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-15 06:41:08,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:08,938 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:41:08,938 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:41:08,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:41:08,939 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:08,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 41 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-04-15 06:41:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:41:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2022-04-15 06:41:08,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:08,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:08,990 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:08,990 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:08,992 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2022-04-15 06:41:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2022-04-15 06:41:08,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:08,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:08,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:41:08,992 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:41:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:08,994 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2022-04-15 06:41:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2022-04-15 06:41:08,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:08,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:08,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:08,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-15 06:41:09,000 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2022-04-15 06:41:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:09,000 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-15 06:41:09,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 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:41:09,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-15 06:41:09,093 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:41:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 06:41:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:41:09,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:09,095 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:41:09,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:41:09,097 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash 550711896, now seen corresponding path program 1 times [2022-04-15 06:41:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:09,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155633305] [2022-04-15 06:41:11,267 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:41:11,371 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:41:11,372 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1059809129, now seen corresponding path program 1 times [2022-04-15 06:41:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:11,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090808559] [2022-04-15 06:41:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:11,385 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:41:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:11,392 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:11,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {595#true} is VALID [2022-04-15 06:41:11,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-15 06:41:11,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {595#true} {595#true} #94#return; {595#true} is VALID [2022-04-15 06:41:11,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:11,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {595#true} is VALID [2022-04-15 06:41:11,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-15 06:41:11,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #94#return; {595#true} is VALID [2022-04-15 06:41:11,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret17 := main(); {595#true} is VALID [2022-04-15 06:41:11,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {595#true} is VALID [2022-04-15 06:41:11,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.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_20 v_main_~x~0_19)) (.cse4 (mod v_main_~x~0_20 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~x~0_19 v_main_~x~0_20) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_20 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_19 v_it_2 1) v_main_~x~0_20)))) (< 0 .cse4) (= v_main_~y~0_20 (+ v_main_~x~0_20 v_main_~y~0_21 (* (- 1) v_main_~x~0_19)))))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_20, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_19, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {595#true} is VALID [2022-04-15 06:41:11,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#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[] {595#true} is VALID [2022-04-15 06:41:11,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {595#true} ~z~0 := ~y~0; {595#true} is VALID [2022-04-15 06:41:11,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#true} assume !(~z~0 % 4294967296 > 0); {595#true} is VALID [2022-04-15 06:41:11,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#true} assume !(~y~0 % 4294967296 > 0); {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:11,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:11,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:11,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {596#false} is VALID [2022-04-15 06:41:11,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !(~y~0 % 4294967296 > 0); {596#false} is VALID [2022-04-15 06:41:11,413 INFO L272 TraceCheckUtils]: 15: Hoare triple {596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {596#false} is VALID [2022-04-15 06:41:11,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2022-04-15 06:41:11,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {596#false} assume 0 == ~cond; {596#false} is VALID [2022-04-15 06:41:11,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-15 06:41:11,414 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:41:11,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:11,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090808559] [2022-04-15 06:41:11,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090808559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:11,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:11,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:11,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:11,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155633305] [2022-04-15 06:41:11,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155633305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:11,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:11,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:41:11,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004903726] [2022-04-15 06:41:11,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:41:11,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:11,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,449 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:41:11,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:41:11,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:11,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:41:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:41:11,449 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:11,672 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2022-04-15 06:41:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:41:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-15 06:41:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-15 06:41:11,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-15 06:41:11,719 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:41:11,720 INFO L225 Difference]: With dead ends: 45 [2022-04-15 06:41:11,720 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:41:11,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:41:11,721 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:11,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:41:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:41:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-04-15 06:41:11,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:11,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,772 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,772 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:11,773 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2022-04-15 06:41:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2022-04-15 06:41:11,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:11,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:11,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:41:11,774 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:41:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:11,775 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2022-04-15 06:41:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2022-04-15 06:41:11,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:11,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:11,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:11,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-15 06:41:11,777 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 19 [2022-04-15 06:41:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:11,777 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-15 06:41:11,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:11,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-15 06:41:11,839 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:41:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 06:41:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:41:11,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:11,839 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:41:11,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:41:11,840 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1953540295, now seen corresponding path program 1 times [2022-04-15 06:41:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:11,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [340927337] [2022-04-15 06:41:12,056 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:41:12,058 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 14378694, now seen corresponding path program 1 times [2022-04-15 06:41:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:12,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340069267] [2022-04-15 06:41:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:12,069 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:12,075 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:12,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:12,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {835#true} is VALID [2022-04-15 06:41:12,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-15 06:41:12,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {835#true} {835#true} #94#return; {835#true} is VALID [2022-04-15 06:41:12,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:12,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {835#true} is VALID [2022-04-15 06:41:12,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2022-04-15 06:41:12,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #94#return; {835#true} is VALID [2022-04-15 06:41:12,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret17 := main(); {835#true} is VALID [2022-04-15 06:41:12,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {835#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {835#true} is VALID [2022-04-15 06:41:12,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {835#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_27 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_29 v_main_~y~0_28)) (.cse4 (= v_main_~x~0_27 v_main_~x~0_26))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~y~0_29 v_main_~y~0_28) (= v_main_~x~0_26 (+ v_main_~x~0_27 v_main_~y~0_29 (* (- 1) v_main_~y~0_28))) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_27 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_29 v_it_3 1) v_main_~y~0_28))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_29, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_27, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_28, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {835#true} is VALID [2022-04-15 06:41:12,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#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[] {835#true} is VALID [2022-04-15 06:41:12,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#true} ~z~0 := ~y~0; {835#true} is VALID [2022-04-15 06:41:12,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#true} assume !(~z~0 % 4294967296 > 0); {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:12,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:12,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:12,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {840#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {836#false} is VALID [2022-04-15 06:41:12,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {836#false} assume !(~z~0 % 4294967296 > 0); {836#false} is VALID [2022-04-15 06:41:12,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {836#false} assume !(~y~0 % 4294967296 > 0); {836#false} is VALID [2022-04-15 06:41:12,110 INFO L272 TraceCheckUtils]: 15: Hoare triple {836#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {836#false} is VALID [2022-04-15 06:41:12,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2022-04-15 06:41:12,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2022-04-15 06:41:12,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {836#false} assume !false; {836#false} is VALID [2022-04-15 06:41:12,111 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:41:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340069267] [2022-04-15 06:41:12,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340069267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:12,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:12,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:12,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [340927337] [2022-04-15 06:41:12,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [340927337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:12,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:12,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:41:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932285972] [2022-04-15 06:41:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:12,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:41:12,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:12,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,149 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:41:12,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:41:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:41:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:41:12,149 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:12,400 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-04-15 06:41:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:12,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:41:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 06:41:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 06:41:12,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-15 06:41:12,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:12,454 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:41:12,454 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:41:12,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:41:12,455 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:12,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 27 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:41:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2022-04-15 06:41:12,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:12,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,509 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,509 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:12,510 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-15 06:41:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-15 06:41:12,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:12,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:12,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:41:12,512 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:41:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:12,513 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-15 06:41:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-15 06:41:12,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:12,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:12,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:12,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-15 06:41:12,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2022-04-15 06:41:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:12,515 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-15 06:41:12,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:12,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-15 06:41:12,745 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:41:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 06:41:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:41:12,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:12,746 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:41:12,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:41:12,746 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1989908199, now seen corresponding path program 1 times [2022-04-15 06:41:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:12,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [314994535] [2022-04-15 06:41:12,924 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:41:12,925 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash -277893978, now seen corresponding path program 1 times [2022-04-15 06:41:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121632535] [2022-04-15 06:41:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:12,936 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:41:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:12,948 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:41:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:13,125 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); {1090#true} is VALID [2022-04-15 06:41:13,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-15 06:41:13,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1090#true} {1090#true} #94#return; {1090#true} is VALID [2022-04-15 06:41:13,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:13,126 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); {1090#true} is VALID [2022-04-15 06:41:13,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-15 06:41:13,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #94#return; {1090#true} is VALID [2022-04-15 06:41:13,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret17 := main(); {1090#true} is VALID [2022-04-15 06:41:13,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1095#(= main_~y~0 0)} is VALID [2022-04-15 06:41:13,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1095#(= main_~y~0 0)} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_35 4294967296)) (.cse1 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse2 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_36 v_it_4 1) v_main_~y~0_35)) (not (<= 1 v_it_4)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_36 v_main_~y~0_35) (= v_main_~x~0_34 (+ v_main_~x~0_35 v_main_~y~0_36 (* (- 1) v_main_~y~0_35)))) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1096#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-15 06:41:13,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [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[] {1097#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:13,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {1098#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} is VALID [2022-04-15 06:41:13,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {1098#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {1095#(= main_~y~0 0)} is VALID [2022-04-15 06:41:13,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {1095#(= 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; {1091#false} is VALID [2022-04-15 06:41:13,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {1091#false} assume !(~y~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-15 06:41:13,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#false} assume !(~x~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-15 06:41:13,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#false} assume !(~z~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-15 06:41:13,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#false} assume !(~y~0 % 4294967296 > 0); {1091#false} is VALID [2022-04-15 06:41:13,135 INFO L272 TraceCheckUtils]: 15: Hoare triple {1091#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1091#false} is VALID [2022-04-15 06:41:13,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2022-04-15 06:41:13,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2022-04-15 06:41:13,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2022-04-15 06:41:13,152 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:41:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121632535] [2022-04-15 06:41:13,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121632535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:13,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:13,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:41:13,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [314994535] [2022-04-15 06:41:13,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [314994535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:13,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:13,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:41:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748897194] [2022-04-15 06:41:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:13,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:41:13,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:13,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:13,469 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:41:13,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:41:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:13,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:41:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:41:13,470 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:13,703 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2022-04-15 06:41:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:41:13,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:41:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 06:41:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 06:41:13,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 06:41:15,495 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:41:15,496 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:41:15,496 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 06:41:15,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:41:15,497 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:15,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-04-15 06:41:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 06:41:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-04-15 06:41:15,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:15,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,570 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,570 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:15,571 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-04-15 06:41:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-15 06:41:15,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:15,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:15,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 06:41:15,571 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 06:41:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:15,572 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-04-15 06:41:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-15 06:41:15,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:15,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:15,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:15,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-04-15 06:41:15,573 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2022-04-15 06:41:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:15,573 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-04-15 06:41:15,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:15,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 39 transitions. [2022-04-15 06:41:17,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-04-15 06:41:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:41:17,741 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:17,741 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:17,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:41:17,742 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash -36937386, now seen corresponding path program 1 times [2022-04-15 06:41:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558798977] [2022-04-15 06:41:18,453 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:41:18,455 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1077715895, now seen corresponding path program 1 times [2022-04-15 06:41:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:18,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016560848] [2022-04-15 06:41:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:18,468 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:41:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:18,478 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:41:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:18,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {1323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1317#true} is VALID [2022-04-15 06:41:18,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#true} assume true; {1317#true} is VALID [2022-04-15 06:41:18,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1317#true} {1317#true} #94#return; {1317#true} is VALID [2022-04-15 06:41:18,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {1317#true} call ULTIMATE.init(); {1323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:18,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1317#true} is VALID [2022-04-15 06:41:18,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1317#true} assume true; {1317#true} is VALID [2022-04-15 06:41:18,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1317#true} {1317#true} #94#return; {1317#true} is VALID [2022-04-15 06:41:18,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {1317#true} call #t~ret17 := main(); {1317#true} is VALID [2022-04-15 06:41:18,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {1317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1317#true} is VALID [2022-04-15 06:41:18,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {1317#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~y~0_44 v_main_~y~0_43)) (.cse3 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse4 (mod v_main_~x~0_42 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_43 (+ v_main_~x~0_42 v_main_~y~0_44 (* (- 1) v_main_~x~0_41))) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_41 v_it_5 1) v_main_~x~0_42)) (< 0 (mod (+ v_main_~x~0_42 (* v_it_5 4294967295)) 4294967296)))) (< v_main_~x~0_41 v_main_~x~0_42)))) InVars {main_~y~0=v_main_~y~0_44, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1317#true} is VALID [2022-04-15 06:41:18,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {1317#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[] {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:18,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:18,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:18,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:18,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {1322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1318#false} is VALID [2022-04-15 06:41:18,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {1318#false} assume !(~x~0 % 4294967296 > 0); {1318#false} is VALID [2022-04-15 06:41:18,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {1318#false} assume !(~z~0 % 4294967296 > 0); {1318#false} is VALID [2022-04-15 06:41:18,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {1318#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {1318#false} is VALID [2022-04-15 06:41:18,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {1318#false} assume !(~y~0 % 4294967296 > 0); {1318#false} is VALID [2022-04-15 06:41:18,520 INFO L272 TraceCheckUtils]: 16: Hoare triple {1318#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1318#false} is VALID [2022-04-15 06:41:18,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {1318#false} ~cond := #in~cond; {1318#false} is VALID [2022-04-15 06:41:18,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {1318#false} assume 0 == ~cond; {1318#false} is VALID [2022-04-15 06:41:18,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2022-04-15 06:41:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:18,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016560848] [2022-04-15 06:41:18,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016560848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:18,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:18,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:18,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:18,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558798977] [2022-04-15 06:41:18,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558798977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:18,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:18,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:41:18,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245563705] [2022-04-15 06:41:18,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:18,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:41:18,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:18,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,614 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:41:18,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:41:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:18,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:41:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:41:18,614 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:18,869 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-04-15 06:41:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:41:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:41:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 06:41:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 06:41:18,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-15 06:41:18,913 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:41:18,914 INFO L225 Difference]: With dead ends: 54 [2022-04-15 06:41:18,914 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 06:41:18,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:41:18,915 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:18,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:41:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 06:41:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2022-04-15 06:41:18,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:18,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,973 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,974 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:18,975 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2022-04-15 06:41:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2022-04-15 06:41:18,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:18,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:18,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 06:41:18,976 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 06:41:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:18,978 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2022-04-15 06:41:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2022-04-15 06:41:18,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:18,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:18,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:18,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-15 06:41:18,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 20 [2022-04-15 06:41:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:18,980 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-15 06:41:18,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-15 06:41:21,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-15 06:41:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:41:21,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:21,165 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:21,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 06:41:21,165 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1992076293, now seen corresponding path program 1 times [2022-04-15 06:41:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:21,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1887031780] [2022-04-15 06:41:21,367 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:41:21,369 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1508806310, now seen corresponding path program 1 times [2022-04-15 06:41:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:21,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067998527] [2022-04-15 06:41:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:21,380 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:41:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,397 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:41:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {1588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-15 06:41:21,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-15 06:41:21,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-15 06:41:21,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {1581#true} call ULTIMATE.init(); {1588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:21,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-15 06:41:21,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-15 06:41:21,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-15 06:41:21,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {1581#true} call #t~ret17 := main(); {1581#true} is VALID [2022-04-15 06:41:21,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1581#true} is VALID [2022-04-15 06:41:21,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse2 (mod v_main_~x~0_50 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) (= v_main_~x~0_50 v_main_~x~0_49) .cse0 .cse1) (and (= v_main_~x~0_49 v_main_~x~0_50) (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse2 0) .cse1) (and (< 0 .cse2) (< v_main_~x~0_49 v_main_~x~0_50) (= v_main_~y~0_51 (+ v_main_~x~0_50 v_main_~y~0_52 (* (- 1) v_main_~x~0_49))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_49 v_it_6 1) v_main_~x~0_50)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_50 (* v_it_6 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1581#true} is VALID [2022-04-15 06:41:21,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1586#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:21,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {1586#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1586#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:21,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {1586#(<= 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; {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:21,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:21,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {1587#(<= (+ (* 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; {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:21,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:21,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {1587#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-15 06:41:21,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {1582#false} assume !(~z~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-15 06:41:21,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#false} assume !(~y~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-15 06:41:21,436 INFO L272 TraceCheckUtils]: 16: Hoare triple {1582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1582#false} is VALID [2022-04-15 06:41:21,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#false} ~cond := #in~cond; {1582#false} is VALID [2022-04-15 06:41:21,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {1582#false} assume 0 == ~cond; {1582#false} is VALID [2022-04-15 06:41:21,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {1582#false} assume !false; {1582#false} is VALID [2022-04-15 06:41:21,437 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:41:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:21,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067998527] [2022-04-15 06:41:21,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067998527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:21,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928254940] [2022-04-15 06:41:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:21,439 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:41:21,442 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:41:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:41:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:21,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {1581#true} call ULTIMATE.init(); {1581#true} is VALID [2022-04-15 06:41:21,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-15 06:41:21,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-15 06:41:21,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-15 06:41:21,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {1581#true} call #t~ret17 := main(); {1581#true} is VALID [2022-04-15 06:41:21,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1581#true} is VALID [2022-04-15 06:41:21,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse2 (mod v_main_~x~0_50 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) (= v_main_~x~0_50 v_main_~x~0_49) .cse0 .cse1) (and (= v_main_~x~0_49 v_main_~x~0_50) (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse2 0) .cse1) (and (< 0 .cse2) (< v_main_~x~0_49 v_main_~x~0_50) (= v_main_~y~0_51 (+ v_main_~x~0_50 v_main_~y~0_52 (* (- 1) v_main_~x~0_49))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_49 v_it_6 1) v_main_~x~0_50)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_50 (* v_it_6 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1581#true} is VALID [2022-04-15 06:41:21,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1581#true} is VALID [2022-04-15 06:41:21,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {1581#true} ~z~0 := ~y~0; {1581#true} is VALID [2022-04-15 06:41:21,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {1581#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:21,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:21,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:21,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:21,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:21,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-15 06:41:21,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#false} assume !(~y~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-15 06:41:21,580 INFO L272 TraceCheckUtils]: 16: Hoare triple {1582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1582#false} is VALID [2022-04-15 06:41:21,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#false} ~cond := #in~cond; {1582#false} is VALID [2022-04-15 06:41:21,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {1582#false} assume 0 == ~cond; {1582#false} is VALID [2022-04-15 06:41:21,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {1582#false} assume !false; {1582#false} is VALID [2022-04-15 06:41:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:21,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:21,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {1582#false} assume !false; {1582#false} is VALID [2022-04-15 06:41:21,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {1582#false} assume 0 == ~cond; {1582#false} is VALID [2022-04-15 06:41:21,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#false} ~cond := #in~cond; {1582#false} is VALID [2022-04-15 06:41:21,644 INFO L272 TraceCheckUtils]: 16: Hoare triple {1582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1582#false} is VALID [2022-04-15 06:41:21,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {1582#false} assume !(~y~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-15 06:41:21,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1582#false} is VALID [2022-04-15 06:41:21,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:21,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:21,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:21,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:21,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {1581#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1619#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:21,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {1581#true} ~z~0 := ~y~0; {1581#true} is VALID [2022-04-15 06:41:21,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse1 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse2 (mod v_main_~x~0_50 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) (= v_main_~x~0_50 v_main_~x~0_49) .cse0 .cse1) (and (= v_main_~x~0_49 v_main_~x~0_50) (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse2 0) .cse1) (and (< 0 .cse2) (< v_main_~x~0_49 v_main_~x~0_50) (= v_main_~y~0_51 (+ v_main_~x~0_50 v_main_~y~0_52 (* (- 1) v_main_~x~0_49))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_49 v_it_6 1) v_main_~x~0_50)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_50 (* v_it_6 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {1581#true} call #t~ret17 := main(); {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1581#true} {1581#true} #94#return; {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {1581#true} assume true; {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {1581#true} call ULTIMATE.init(); {1581#true} is VALID [2022-04-15 06:41:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:21,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928254940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:21,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:21,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 06:41:21,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1887031780] [2022-04-15 06:41:21,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1887031780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:21,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:21,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:21,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380797926] [2022-04-15 06:41:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:21,710 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:41:21,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:21,710 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:41:21,732 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:41:21,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:21,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:41:21,733 INFO L87 Difference]: Start difference. First operand 28 states and 37 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:41:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:22,132 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2022-04-15 06:41:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:41:22,132 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:41:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:22,132 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:41:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 06:41:22,133 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:41:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 06:41:22,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 06:41:22,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:22,177 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:41:22,178 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:41:22,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:41:22,178 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:22,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:41:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-04-15 06:41:22,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:22,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:22,255 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:22,256 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:22,258 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-04-15 06:41:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2022-04-15 06:41:22,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:22,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:22,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:41:22,259 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:41:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:22,260 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-04-15 06:41:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2022-04-15 06:41:22,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:22,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:22,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:22,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-15 06:41:22,261 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 20 [2022-04-15 06:41:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:22,261 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-15 06:41:22,261 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:41:22,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-15 06:41:26,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 44 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 06:41:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:41:26,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:26,453 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:26,475 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:41:26,653 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:41:26,654 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:26,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-04-15 06:41:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:26,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [322601310] [2022-04-15 06:41:26,841 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:41:26,843 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:26,845 INFO L85 PathProgramCache]: Analyzing trace with hash -62207689, now seen corresponding path program 1 times [2022-04-15 06:41:26,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:26,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083348620] [2022-04-15 06:41:26,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:26,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:26,854 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:41:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:26,862 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:26,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {2018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-15 06:41:26,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-15 06:41:26,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-15 06:41:26,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {2011#true} call ULTIMATE.init(); {2018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:26,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {2018#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-15 06:41:26,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-15 06:41:26,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-15 06:41:26,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {2011#true} call #t~ret17 := main(); {2011#true} is VALID [2022-04-15 06:41:26,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {2011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2011#true} is VALID [2022-04-15 06:41:26,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {2011#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|)) (.cse0 (mod v_main_~x~0_58 4294967296))) (or (and (<= .cse0 0) .cse1 (= v_main_~y~0_59 v_main_~y~0_60) .cse2 .cse3) (and .cse1 (= v_main_~y~0_60 v_main_~y~0_59) .cse2 .cse3) (and (= v_main_~y~0_59 (+ v_main_~x~0_58 v_main_~y~0_60 (* (- 1) v_main_~x~0_57))) (< 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)))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2011#true} is VALID [2022-04-15 06:41:26,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2011#true} is VALID [2022-04-15 06:41:26,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#true} ~z~0 := ~y~0; {2016#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:26,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#(= (+ 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; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:26,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:26,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-15 06:41:26,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2012#false} is VALID [2022-04-15 06:41:26,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {2012#false} assume !(~x~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {2012#false} assume !(~z~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {2012#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {2012#false} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L272 TraceCheckUtils]: 17: Hoare triple {2012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#false} ~cond := #in~cond; {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#false} assume 0 == ~cond; {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#false} assume !false; {2012#false} is VALID [2022-04-15 06:41:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083348620] [2022-04-15 06:41:26,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083348620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:26,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654414199] [2022-04-15 06:41:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:26,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:26,897 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:41:26,898 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:41:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:26,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:26,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:27,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {2011#true} call ULTIMATE.init(); {2011#true} is VALID [2022-04-15 06:41:27,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {2011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-15 06:41:27,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-15 06:41:27,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-15 06:41:27,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {2011#true} call #t~ret17 := main(); {2011#true} is VALID [2022-04-15 06:41:27,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {2011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2011#true} is VALID [2022-04-15 06:41:27,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {2011#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|)) (.cse0 (mod v_main_~x~0_58 4294967296))) (or (and (<= .cse0 0) .cse1 (= v_main_~y~0_59 v_main_~y~0_60) .cse2 .cse3) (and .cse1 (= v_main_~y~0_60 v_main_~y~0_59) .cse2 .cse3) (and (= v_main_~y~0_59 (+ v_main_~x~0_58 v_main_~y~0_60 (* (- 1) v_main_~x~0_57))) (< 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)))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2011#true} is VALID [2022-04-15 06:41:27,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2011#true} is VALID [2022-04-15 06:41:27,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#true} ~z~0 := ~y~0; {2016#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:27,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {2016#(= (+ 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; {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:27,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:27,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:27,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {2049#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-15 06:41:27,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-15 06:41:27,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-15 06:41:27,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {2059#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:27,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-15 06:41:27,198 INFO L272 TraceCheckUtils]: 17: Hoare triple {2012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2012#false} is VALID [2022-04-15 06:41:27,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#false} ~cond := #in~cond; {2012#false} is VALID [2022-04-15 06:41:27,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#false} assume 0 == ~cond; {2012#false} is VALID [2022-04-15 06:41:27,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#false} assume !false; {2012#false} is VALID [2022-04-15 06:41:27,198 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:41:27,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:27,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#false} assume !false; {2012#false} is VALID [2022-04-15 06:41:27,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#false} assume 0 == ~cond; {2012#false} is VALID [2022-04-15 06:41:27,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#false} ~cond := #in~cond; {2012#false} is VALID [2022-04-15 06:41:27,438 INFO L272 TraceCheckUtils]: 17: Hoare triple {2012#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2012#false} is VALID [2022-04-15 06:41:27,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2012#false} is VALID [2022-04-15 06:41:27,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:27,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} is VALID [2022-04-15 06:41:27,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} is VALID [2022-04-15 06:41:27,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2099#(<= (+ 2 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))) main_~y~0)} is VALID [2022-04-15 06:41:27,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:27,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:27,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {2118#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0) (<= (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; {2017#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:27,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#true} ~z~0 := ~y~0; {2118#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 06:41:27,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2011#true} is VALID [2022-04-15 06:41:27,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {2011#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|)) (.cse0 (mod v_main_~x~0_58 4294967296))) (or (and (<= .cse0 0) .cse1 (= v_main_~y~0_59 v_main_~y~0_60) .cse2 .cse3) (and .cse1 (= v_main_~y~0_60 v_main_~y~0_59) .cse2 .cse3) (and (= v_main_~y~0_59 (+ v_main_~x~0_58 v_main_~y~0_60 (* (- 1) v_main_~x~0_57))) (< 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)))) InVars {main_~y~0=v_main_~y~0_60, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_58, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_59, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_57, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2011#true} is VALID [2022-04-15 06:41:27,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2011#true} is VALID [2022-04-15 06:41:27,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2011#true} call #t~ret17 := main(); {2011#true} is VALID [2022-04-15 06:41:27,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2011#true} {2011#true} #94#return; {2011#true} is VALID [2022-04-15 06:41:27,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2011#true} assume true; {2011#true} is VALID [2022-04-15 06:41:27,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2011#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2011#true} is VALID [2022-04-15 06:41:27,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {2011#true} call ULTIMATE.init(); {2011#true} is VALID [2022-04-15 06:41:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:27,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654414199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:27,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:27,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 9 [2022-04-15 06:41:27,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:27,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [322601310] [2022-04-15 06:41:27,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [322601310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:27,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:27,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169120142] [2022-04-15 06:41:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:41:27,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:27,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,484 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:41:27,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:27,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:27,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:41:27,486 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:27,748 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-15 06:41:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:41:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 06:41:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-15 06:41:27,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-15 06:41:27,789 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:41:27,790 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:41:27,790 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:41:27,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:41:27,790 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:27,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:41:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-15 06:41:27,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:27,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,841 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,841 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:27,842 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 06:41:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 06:41:27,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:27,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:27,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:41:27,843 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:41:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:27,843 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 06:41:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 06:41:27,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:27,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:27,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:27,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-04-15 06:41:27,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 21 [2022-04-15 06:41:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:27,844 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-04-15 06:41:27,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:27,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 39 transitions. [2022-04-15 06:41:32,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-04-15 06:41:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:41:32,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:32,029 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:32,048 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:41:32,230 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:41:32,230 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -694813431, now seen corresponding path program 1 times [2022-04-15 06:41:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1029303298] [2022-04-15 06:41:32,398 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:41:32,399 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1216691720, now seen corresponding path program 1 times [2022-04-15 06:41:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914643842] [2022-04-15 06:41:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:32,414 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:41:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:32,437 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:41:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:32,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {2384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-15 06:41:32,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 06:41:32,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-15 06:41:32,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:32,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {2384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-15 06:41:32,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 06:41:32,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-15 06:41:32,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret17 := main(); {2370#true} is VALID [2022-04-15 06:41:32,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:41:32,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_67 4294967296)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_67 v_main_~x~0_66))) (or (and (< 0 .cse0) (< v_main_~x~0_66 v_main_~x~0_67) (= v_main_~y~0_70 (+ v_main_~x~0_67 v_main_~y~0_71 (* (- 1) v_main_~x~0_66))) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_67) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_8 1) v_main_~x~0_67)) (not (<= 1 v_it_8))))) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 .cse2 (<= .cse0 0) .cse3) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2376#(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:41:32,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {2376#(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))))} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2377#(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:41:32,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {2377#(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; {2378#(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:41:32,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {2378#(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; {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:32,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:32,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {2379#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:32,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:32,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:32,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:32,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:32,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:32,641 INFO L272 TraceCheckUtils]: 17: Hoare triple {2381#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2382#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:41:32,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {2382#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2383#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:41:32,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {2383#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2371#false} is VALID [2022-04-15 06:41:32,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-15 06:41:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914643842] [2022-04-15 06:41:32,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914643842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38088615] [2022-04-15 06:41:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:32,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:32,644 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:41:32,644 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:41:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:32,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:41:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:32,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:32,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2022-04-15 06:41:32,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-15 06:41:32,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 06:41:32,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-15 06:41:32,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret17 := main(); {2370#true} is VALID [2022-04-15 06:41:32,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2370#true} is VALID [2022-04-15 06:41:32,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {2370#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_67 4294967296)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_67 v_main_~x~0_66))) (or (and (< 0 .cse0) (< v_main_~x~0_66 v_main_~x~0_67) (= v_main_~y~0_70 (+ v_main_~x~0_67 v_main_~y~0_71 (* (- 1) v_main_~x~0_66))) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_67) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_8 1) v_main_~x~0_67)) (not (<= 1 v_it_8))))) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 .cse2 (<= .cse0 0) .cse3) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2370#true} is VALID [2022-04-15 06:41:32,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2370#true} is VALID [2022-04-15 06:41:32,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#true} ~z~0 := ~y~0; {2370#true} is VALID [2022-04-15 06:41:32,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:32,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:32,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-15 06:41:32,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {2371#false} assume !(~y~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-15 06:41:32,757 INFO L272 TraceCheckUtils]: 17: Hoare triple {2371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2371#false} is VALID [2022-04-15 06:41:32,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2022-04-15 06:41:32,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2022-04-15 06:41:32,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-15 06:41:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:32,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:32,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-15 06:41:32,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2022-04-15 06:41:32,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2022-04-15 06:41:32,812 INFO L272 TraceCheckUtils]: 17: Hoare triple {2371#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2371#false} is VALID [2022-04-15 06:41:32,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {2371#false} assume !(~y~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-15 06:41:32,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2371#false} is VALID [2022-04-15 06:41:32,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2422#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2422#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:41:32,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:32,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2415#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:41:32,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#true} ~z~0 := ~y~0; {2370#true} is VALID [2022-04-15 06:41:32,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2370#true} is VALID [2022-04-15 06:41:32,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {2370#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_67 4294967296)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_71 v_main_~y~0_70)) (.cse3 (= v_main_~x~0_67 v_main_~x~0_66))) (or (and (< 0 .cse0) (< v_main_~x~0_66 v_main_~x~0_67) (= v_main_~y~0_70 (+ v_main_~x~0_67 v_main_~y~0_71 (* (- 1) v_main_~x~0_66))) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_67) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_8 1) v_main_~x~0_67)) (not (<= 1 v_it_8))))) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 .cse2 (<= .cse0 0) .cse3) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_70, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2370#true} is VALID [2022-04-15 06:41:32,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2370#true} is VALID [2022-04-15 06:41:32,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret17 := main(); {2370#true} is VALID [2022-04-15 06:41:32,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #94#return; {2370#true} is VALID [2022-04-15 06:41:32,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 06:41:32,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2370#true} is VALID [2022-04-15 06:41:32,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2022-04-15 06:41:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:32,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38088615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:32,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:32,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 14 [2022-04-15 06:41:33,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1029303298] [2022-04-15 06:41:33,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1029303298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:33,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:33,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:41:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139664024] [2022-04-15 06:41:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:33,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:41:33,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:33,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,071 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:41:33,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:41:33,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:33,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:41:33,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:41:33,072 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:33,803 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-15 06:41:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:41:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:41:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2022-04-15 06:41:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2022-04-15 06:41:33,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 45 transitions. [2022-04-15 06:41:33,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:33,858 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:41:33,858 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:41:33,858 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:41:33,859 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:33,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 52 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 142 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-04-15 06:41:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:41:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 06:41:33,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:33,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,958 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,960 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:33,966 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-15 06:41:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-15 06:41:33,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:33,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:33,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:41:33,966 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:41:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:33,968 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-15 06:41:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-15 06:41:33,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:33,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:33,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:33,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2022-04-15 06:41:33,969 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 21 [2022-04-15 06:41:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:33,969 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2022-04-15 06:41:33,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:33,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 52 transitions. [2022-04-15 06:41:36,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2022-04-15 06:41:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:41:36,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:36,365 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:36,381 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:41:36,565 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:41:36,565 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-04-15 06:41:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:36,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433782962] [2022-04-15 06:41:36,802 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:41:36,804 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:36,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1091268038, now seen corresponding path program 1 times [2022-04-15 06:41:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:36,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310417733] [2022-04-15 06:41:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:36,813 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:41:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:36,830 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:41:36,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:36,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {2773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-15 06:41:36,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-15 06:41:36,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-15 06:41:36,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {2762#true} call ULTIMATE.init(); {2773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:36,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {2773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-15 06:41:36,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-15 06:41:36,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-15 06:41:36,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#true} call #t~ret17 := main(); {2762#true} is VALID [2022-04-15 06:41:36,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2767#(= main_~y~0 0)} is VALID [2022-04-15 06:41:36,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(= main_~y~0 0)} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_76 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|))) (or (and (< v_main_~y~0_80 v_main_~y~0_79) (< 0 .cse0) (forall ((v_it_9 Int)) (or (< 0 (mod (+ v_main_~x~0_76 (* v_it_9 4294967295)) 4294967296)) (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_80 v_it_9 1) v_main_~y~0_79)))) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_80 (* (- 1) v_main_~y~0_79)))) (and (= v_main_~y~0_79 v_main_~y~0_80) .cse1 .cse2 .cse3 (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_80 v_main_~y~0_79) .cse3))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2768#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-15 06:41:36,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {2768#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2769#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:36,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {2769#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {2770#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:36,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {2770#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:36,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:36,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:36,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:36,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:36,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:36,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-15 06:41:36,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {2763#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2763#false} is VALID [2022-04-15 06:41:36,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {2763#false} assume !(~y~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-15 06:41:36,983 INFO L272 TraceCheckUtils]: 18: Hoare triple {2763#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2763#false} is VALID [2022-04-15 06:41:36,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {2763#false} ~cond := #in~cond; {2763#false} is VALID [2022-04-15 06:41:36,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {2763#false} assume 0 == ~cond; {2763#false} is VALID [2022-04-15 06:41:36,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {2763#false} assume !false; {2763#false} is VALID [2022-04-15 06:41:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:36,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310417733] [2022-04-15 06:41:36,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310417733] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:36,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449607033] [2022-04-15 06:41:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:36,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:36,985 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:41:36,986 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:41:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:37,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:37,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:37,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {2762#true} call ULTIMATE.init(); {2762#true} is VALID [2022-04-15 06:41:37,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-15 06:41:37,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-15 06:41:37,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-15 06:41:37,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#true} call #t~ret17 := main(); {2762#true} is VALID [2022-04-15 06:41:37,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2762#true} is VALID [2022-04-15 06:41:37,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {2762#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_76 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|))) (or (and (< v_main_~y~0_80 v_main_~y~0_79) (< 0 .cse0) (forall ((v_it_9 Int)) (or (< 0 (mod (+ v_main_~x~0_76 (* v_it_9 4294967295)) 4294967296)) (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_80 v_it_9 1) v_main_~y~0_79)))) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_80 (* (- 1) v_main_~y~0_79)))) (and (= v_main_~y~0_79 v_main_~y~0_80) .cse1 .cse2 .cse3 (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_80 v_main_~y~0_79) .cse3))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2762#true} is VALID [2022-04-15 06:41:37,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {2762#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2762#true} is VALID [2022-04-15 06:41:37,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {2762#true} ~z~0 := ~y~0; {2762#true} is VALID [2022-04-15 06:41:37,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {2762#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:37,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:37,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-15 06:41:37,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {2763#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2763#false} is VALID [2022-04-15 06:41:37,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {2763#false} assume !(~y~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-15 06:41:37,290 INFO L272 TraceCheckUtils]: 18: Hoare triple {2763#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2763#false} is VALID [2022-04-15 06:41:37,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {2763#false} ~cond := #in~cond; {2763#false} is VALID [2022-04-15 06:41:37,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {2763#false} assume 0 == ~cond; {2763#false} is VALID [2022-04-15 06:41:37,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {2763#false} assume !false; {2763#false} is VALID [2022-04-15 06:41:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:37,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:37,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {2763#false} assume !false; {2763#false} is VALID [2022-04-15 06:41:37,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {2763#false} assume 0 == ~cond; {2763#false} is VALID [2022-04-15 06:41:37,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {2763#false} ~cond := #in~cond; {2763#false} is VALID [2022-04-15 06:41:37,370 INFO L272 TraceCheckUtils]: 18: Hoare triple {2763#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2763#false} is VALID [2022-04-15 06:41:37,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {2763#false} assume !(~y~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-15 06:41:37,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {2763#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {2763#false} is VALID [2022-04-15 06:41:37,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2763#false} is VALID [2022-04-15 06:41:37,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2772#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:37,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {2762#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2771#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:37,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {2762#true} ~z~0 := ~y~0; {2762#true} is VALID [2022-04-15 06:41:37,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {2762#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2762#true} is VALID [2022-04-15 06:41:37,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {2762#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_76 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|))) (or (and (< v_main_~y~0_80 v_main_~y~0_79) (< 0 .cse0) (forall ((v_it_9 Int)) (or (< 0 (mod (+ v_main_~x~0_76 (* v_it_9 4294967295)) 4294967296)) (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_80 v_it_9 1) v_main_~y~0_79)))) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_80 (* (- 1) v_main_~y~0_79)))) (and (= v_main_~y~0_79 v_main_~y~0_80) .cse1 .cse2 .cse3 (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_80 v_main_~y~0_79) .cse3))) InVars {main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_79, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2762#true} is VALID [2022-04-15 06:41:37,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2762#true} is VALID [2022-04-15 06:41:37,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#true} call #t~ret17 := main(); {2762#true} is VALID [2022-04-15 06:41:37,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#true} {2762#true} #94#return; {2762#true} is VALID [2022-04-15 06:41:37,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#true} assume true; {2762#true} is VALID [2022-04-15 06:41:37,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2762#true} is VALID [2022-04-15 06:41:37,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {2762#true} call ULTIMATE.init(); {2762#true} is VALID [2022-04-15 06:41:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:37,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449607033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:37,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:37,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 9 [2022-04-15 06:41:37,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:37,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433782962] [2022-04-15 06:41:37,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433782962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:37,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:37,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:37,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730064781] [2022-04-15 06:41:37,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:37,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:41:37,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:37,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:37,630 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:41:37,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:41:37,631 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:38,099 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2022-04-15 06:41:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:41:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:41:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-15 06:41:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-15 06:41:38,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-04-15 06:41:38,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:38,201 INFO L225 Difference]: With dead ends: 58 [2022-04-15 06:41:38,201 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 06:41:38,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:41:38,202 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:38,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 63 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-04-15 06:41:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 06:41:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-04-15 06:41:38,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:38,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have 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:41:38,359 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have 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:41:38,359 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have 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:41:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:38,360 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-04-15 06:41:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2022-04-15 06:41:38,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:38,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:38,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 06:41:38,361 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 06:41:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:38,361 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-04-15 06:41:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2022-04-15 06:41:38,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:38,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:38,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:38,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have 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:41:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2022-04-15 06:41:38,362 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 22 [2022-04-15 06:41:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:38,363 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2022-04-15 06:41:38,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:38,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 62 transitions. [2022-04-15 06:41:42,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 60 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-15 06:41:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:41:42,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:42,579 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:42,596 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:41:42,779 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:41:42,780 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1372943636, now seen corresponding path program 1 times [2022-04-15 06:41:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:42,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282466667] [2022-04-15 06:41:43,010 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:41:43,012 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash 193164405, now seen corresponding path program 1 times [2022-04-15 06:41:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:43,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568803711] [2022-04-15 06:41:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:43,021 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:41:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:43,031 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:43,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {3229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-15 06:41:43,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-15 06:41:43,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-15 06:41:43,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {3221#true} call ULTIMATE.init(); {3229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:43,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {3229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-15 06:41:43,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-15 06:41:43,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-15 06:41:43,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {3221#true} call #t~ret17 := main(); {3221#true} is VALID [2022-04-15 06:41:43,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {3221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3221#true} is VALID [2022-04-15 06:41:43,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_85 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse3 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< v_main_~x~0_84 v_main_~x~0_85) (< 0 .cse2) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_84 v_it_10 1) v_main_~x~0_85)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_85 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_85 v_main_~y~0_90 (* (- 1) v_main_~x~0_84)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3221#true} is VALID [2022-04-15 06:41:43,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {3221#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3221#true} is VALID [2022-04-15 06:41:43,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {3221#true} ~z~0 := ~y~0; {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:43,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {3226#(= (+ 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; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:43,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:43,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {3228#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3222#false} is VALID [2022-04-15 06:41:43,089 INFO L272 TraceCheckUtils]: 18: Hoare triple {3222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3222#false} is VALID [2022-04-15 06:41:43,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#false} ~cond := #in~cond; {3222#false} is VALID [2022-04-15 06:41:43,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#false} assume 0 == ~cond; {3222#false} is VALID [2022-04-15 06:41:43,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#false} assume !false; {3222#false} is VALID [2022-04-15 06:41:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568803711] [2022-04-15 06:41:43,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568803711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348587041] [2022-04-15 06:41:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:43,091 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:41:43,092 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:41:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:43,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:43,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:43,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {3221#true} call ULTIMATE.init(); {3221#true} is VALID [2022-04-15 06:41:43,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {3221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-15 06:41:43,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-15 06:41:43,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-15 06:41:43,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {3221#true} call #t~ret17 := main(); {3221#true} is VALID [2022-04-15 06:41:43,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {3221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3221#true} is VALID [2022-04-15 06:41:43,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_85 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse3 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< v_main_~x~0_84 v_main_~x~0_85) (< 0 .cse2) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_84 v_it_10 1) v_main_~x~0_85)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_85 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_85 v_main_~y~0_90 (* (- 1) v_main_~x~0_84)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3221#true} is VALID [2022-04-15 06:41:43,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {3221#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3221#true} is VALID [2022-04-15 06:41:43,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {3221#true} ~z~0 := ~y~0; {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:43,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {3226#(= (+ 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; {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} is VALID [2022-04-15 06:41:43,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} assume !(~z~0 % 4294967296 > 0); {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} is VALID [2022-04-15 06:41:43,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {3260#(= 0 (+ main_~z~0 (* (- 1) main_~y~0) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3267#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:41:43,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {3267#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {3267#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:41:43,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {3267#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:43,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !(~x~0 % 4294967296 > 0); {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:43,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {3226#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3222#false} is VALID [2022-04-15 06:41:43,361 INFO L272 TraceCheckUtils]: 18: Hoare triple {3222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3222#false} is VALID [2022-04-15 06:41:43,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#false} ~cond := #in~cond; {3222#false} is VALID [2022-04-15 06:41:43,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#false} assume 0 == ~cond; {3222#false} is VALID [2022-04-15 06:41:43,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#false} assume !false; {3222#false} is VALID [2022-04-15 06:41:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:43,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:43,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#false} assume !false; {3222#false} is VALID [2022-04-15 06:41:43,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#false} assume 0 == ~cond; {3222#false} is VALID [2022-04-15 06:41:43,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#false} ~cond := #in~cond; {3222#false} is VALID [2022-04-15 06:41:43,627 INFO L272 TraceCheckUtils]: 18: Hoare triple {3222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3222#false} is VALID [2022-04-15 06:41:43,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3222#false} is VALID [2022-04-15 06:41:43,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3227#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:43,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:41:43,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:41:43,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !(~y~0 % 4294967296 > 0); {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-15 06:41:43,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3323#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-15 06:41:43,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-15 06:41:43,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 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; {3330#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-15 06:41:43,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {3221#true} ~z~0 := ~y~0; {3316#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:41:43,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {3221#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3221#true} is VALID [2022-04-15 06:41:43,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_85 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse3 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< v_main_~x~0_84 v_main_~x~0_85) (< 0 .cse2) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_84 v_it_10 1) v_main_~x~0_85)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_85 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_85 v_main_~y~0_90 (* (- 1) v_main_~x~0_84)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3221#true} is VALID [2022-04-15 06:41:43,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {3221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3221#true} is VALID [2022-04-15 06:41:43,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {3221#true} call #t~ret17 := main(); {3221#true} is VALID [2022-04-15 06:41:43,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3221#true} {3221#true} #94#return; {3221#true} is VALID [2022-04-15 06:41:43,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {3221#true} assume true; {3221#true} is VALID [2022-04-15 06:41:43,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {3221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3221#true} is VALID [2022-04-15 06:41:43,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {3221#true} call ULTIMATE.init(); {3221#true} is VALID [2022-04-15 06:41:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:43,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348587041] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:43,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:43,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-04-15 06:41:43,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:43,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282466667] [2022-04-15 06:41:43,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282466667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:43,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:43,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:41:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900203862] [2022-04-15 06:41:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:43,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:41:43,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:43,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:43,695 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:41:43,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:41:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:41:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:41:43,695 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:44,310 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2022-04-15 06:41:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:41:44,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:41:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 06:41:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 06:41:44,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-15 06:41:44,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:44,374 INFO L225 Difference]: With dead ends: 70 [2022-04-15 06:41:44,374 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:41:44,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:41:44,375 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:44,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 40 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:41:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-04-15 06:41:44,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:44,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,566 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,566 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:44,567 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2022-04-15 06:41:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-04-15 06:41:44,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:44,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:44,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:41:44,568 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:41:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:44,569 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2022-04-15 06:41:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-04-15 06:41:44,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:44,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:44,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:44,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 47 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2022-04-15 06:41:44,570 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 22 [2022-04-15 06:41:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:44,570 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2022-04-15 06:41:44,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:44,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 75 transitions. [2022-04-15 06:41:48,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2022-04-15 06:41:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:41:48,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:48,821 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:48,839 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:41:49,021 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:41:49,022 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 547263768, now seen corresponding path program 2 times [2022-04-15 06:41:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1194513368] [2022-04-15 06:41:49,218 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:41:49,219 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash 19397015, now seen corresponding path program 1 times [2022-04-15 06:41:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:49,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983004715] [2022-04-15 06:41:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:49,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:49,232 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:41:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,241 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:41:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {3765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-15 06:41:49,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-15 06:41:49,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-15 06:41:49,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {3758#true} call ULTIMATE.init(); {3765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:49,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {3765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-15 06:41:49,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-15 06:41:49,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-15 06:41:49,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {3758#true} call #t~ret17 := main(); {3758#true} is VALID [2022-04-15 06:41:49,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {3758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3758#true} is VALID [2022-04-15 06:41:49,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {3758#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse0 (mod v_main_~x~0_95 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_100 (+ v_main_~x~0_95 v_main_~y~0_101 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_94 v_it_11 1) v_main_~x~0_95)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_11)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3758#true} is VALID [2022-04-15 06:41:49,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {3758#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {3763#(<= 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; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {3764#(<= 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; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {3759#false} assume !(~x~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {3759#false} assume !(~z~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {3759#false} assume !(~y~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L272 TraceCheckUtils]: 19: Hoare triple {3759#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {3759#false} ~cond := #in~cond; {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {3759#false} assume 0 == ~cond; {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {3759#false} assume !false; {3759#false} is VALID [2022-04-15 06:41:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:49,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:49,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983004715] [2022-04-15 06:41:49,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983004715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:49,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392934328] [2022-04-15 06:41:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:49,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:49,284 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:41:49,285 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:41:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:49,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {3758#true} call ULTIMATE.init(); {3758#true} is VALID [2022-04-15 06:41:49,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {3758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-15 06:41:49,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-15 06:41:49,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-15 06:41:49,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {3758#true} call #t~ret17 := main(); {3758#true} is VALID [2022-04-15 06:41:49,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {3758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3758#true} is VALID [2022-04-15 06:41:49,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {3758#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse0 (mod v_main_~x~0_95 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_100 (+ v_main_~x~0_95 v_main_~y~0_101 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_94 v_it_11 1) v_main_~x~0_95)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_11)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3758#true} is VALID [2022-04-15 06:41:49,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {3758#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {3763#(<= 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; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {3764#(<= 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; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3759#false} is VALID [2022-04-15 06:41:49,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {3759#false} assume !(~x~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3759#false} is VALID [2022-04-15 06:41:49,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {3759#false} assume !(~z~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {3759#false} assume !(~y~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,518 INFO L272 TraceCheckUtils]: 19: Hoare triple {3759#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3759#false} is VALID [2022-04-15 06:41:49,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {3759#false} ~cond := #in~cond; {3759#false} is VALID [2022-04-15 06:41:49,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {3759#false} assume 0 == ~cond; {3759#false} is VALID [2022-04-15 06:41:49,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {3759#false} assume !false; {3759#false} is VALID [2022-04-15 06:41:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:49,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:49,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {3759#false} assume !false; {3759#false} is VALID [2022-04-15 06:41:49,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {3759#false} assume 0 == ~cond; {3759#false} is VALID [2022-04-15 06:41:49,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {3759#false} ~cond := #in~cond; {3759#false} is VALID [2022-04-15 06:41:49,695 INFO L272 TraceCheckUtils]: 19: Hoare triple {3759#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3759#false} is VALID [2022-04-15 06:41:49,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {3759#false} assume !(~y~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {3759#false} assume !(~z~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {3759#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3759#false} is VALID [2022-04-15 06:41:49,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {3759#false} assume !(~x~0 % 4294967296 > 0); {3759#false} is VALID [2022-04-15 06:41:49,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3759#false} is VALID [2022-04-15 06:41:49,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {3764#(<= 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; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {3763#(<= 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; {3764#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:49,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {3758#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3763#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:49,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {3758#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse0 (mod v_main_~x~0_95 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_100 (+ v_main_~x~0_95 v_main_~y~0_101 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_94 v_it_11 1) v_main_~x~0_95)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_11)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3758#true} is VALID [2022-04-15 06:41:49,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {3758#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3758#true} is VALID [2022-04-15 06:41:49,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {3758#true} call #t~ret17 := main(); {3758#true} is VALID [2022-04-15 06:41:49,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3758#true} {3758#true} #94#return; {3758#true} is VALID [2022-04-15 06:41:49,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {3758#true} assume true; {3758#true} is VALID [2022-04-15 06:41:49,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {3758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3758#true} is VALID [2022-04-15 06:41:49,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {3758#true} call ULTIMATE.init(); {3758#true} is VALID [2022-04-15 06:41:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:49,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392934328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:49,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:49,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 06:41:49,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:49,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1194513368] [2022-04-15 06:41:49,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1194513368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:49,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:49,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394457035] [2022-04-15 06:41:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:49,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:41:49,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:49,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:41:49,775 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:41:49,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:49,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:41:49,775 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:41:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:50,282 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-04-15 06:41:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:41:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:41:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-15 06:41:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:41:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-15 06:41:50,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-15 06:41:50,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:50,372 INFO L225 Difference]: With dead ends: 85 [2022-04-15 06:41:50,372 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:41:50,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:41:50,374 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:50,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 39 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:41:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-04-15 06:41:50,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:50,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:50,564 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:50,564 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:50,565 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-15 06:41:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2022-04-15 06:41:50,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:50,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:50,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 06:41:50,566 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 06:41:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:50,567 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-15 06:41:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2022-04-15 06:41:50,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:50,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:50,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:50,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-04-15 06:41:50,568 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 23 [2022-04-15 06:41:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:50,568 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-04-15 06:41:50,568 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:41:50,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 71 transitions. [2022-04-15 06:41:54,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 69 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-15 06:41:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:41:54,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:54,828 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:54,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 06:41:55,029 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:41:55,029 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1894791784, now seen corresponding path program 2 times [2022-04-15 06:41:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:55,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543354202] [2022-04-15 06:41:55,261 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:41:55,262 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash -737107497, now seen corresponding path program 1 times [2022-04-15 06:41:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:55,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989747285] [2022-04-15 06:41:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:55,272 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:41:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:55,315 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:55,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {4338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-15 06:41:55,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-15 06:41:55,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-15 06:41:55,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {4326#true} call ULTIMATE.init(); {4338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:55,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {4338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-15 06:41:55,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-15 06:41:55,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-15 06:41:55,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {4326#true} call #t~ret17 := main(); {4326#true} is VALID [2022-04-15 06:41:55,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {4326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4331#(= main_~y~0 0)} is VALID [2022-04-15 06:41:55,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {4331#(= main_~y~0 0)} [120] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_110 4294967296)) (.cse1 (= v_main_~y~0_112 v_main_~y~0_111)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_109 v_main_~x~0_110) (= v_main_~y~0_111 (+ v_main_~x~0_110 v_main_~y~0_112 (* v_main_~x~0_109 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_109 v_it_12 1) v_main_~x~0_110)) (< 0 (mod (+ v_main_~x~0_110 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0)) (and (= v_main_~x~0_110 v_main_~x~0_109) .cse1 .cse2 .cse3) (and (<= .cse0 0) .cse1 (= v_main_~x~0_109 v_main_~x~0_110) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_112, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4332#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-15 06:41:55,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {4332#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4333#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:55,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {4333#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {4334#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~y~0 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:55,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~y~0 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4335#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:55,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {4335#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:55,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {4336#(<= 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; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#(<= 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; {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {4327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {4327#false} assume !(~x~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {4327#false} assume !(~z~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {4327#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L272 TraceCheckUtils]: 19: Hoare triple {4327#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {4327#false} ~cond := #in~cond; {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {4327#false} assume 0 == ~cond; {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {4327#false} assume !false; {4327#false} is VALID [2022-04-15 06:41:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:55,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989747285] [2022-04-15 06:41:55,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989747285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:55,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096022194] [2022-04-15 06:41:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:55,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:55,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:55,464 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:41:55,465 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:41:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:55,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:55,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:55,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {4326#true} call ULTIMATE.init(); {4326#true} is VALID [2022-04-15 06:41:55,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {4326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-15 06:41:55,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-15 06:41:55,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-15 06:41:55,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {4326#true} call #t~ret17 := main(); {4326#true} is VALID [2022-04-15 06:41:55,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {4326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4326#true} is VALID [2022-04-15 06:41:55,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {4326#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_110 4294967296)) (.cse1 (= v_main_~y~0_112 v_main_~y~0_111)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_109 v_main_~x~0_110) (= v_main_~y~0_111 (+ v_main_~x~0_110 v_main_~y~0_112 (* v_main_~x~0_109 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_109 v_it_12 1) v_main_~x~0_110)) (< 0 (mod (+ v_main_~x~0_110 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0)) (and (= v_main_~x~0_110 v_main_~x~0_109) .cse1 .cse2 .cse3) (and (<= .cse0 0) .cse1 (= v_main_~x~0_109 v_main_~x~0_110) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_112, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4326#true} is VALID [2022-04-15 06:41:55,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {4326#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4326#true} is VALID [2022-04-15 06:41:55,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {4326#true} ~z~0 := ~y~0; {4366#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:41:55,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {4366#(= 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; {4370#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:41:55,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {4370#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:55,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {4336#(<= 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; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#(<= 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; {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4327#false} is VALID [2022-04-15 06:41:55,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-15 06:41:55,724 INFO L272 TraceCheckUtils]: 19: Hoare triple {4327#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4327#false} is VALID [2022-04-15 06:41:55,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {4327#false} ~cond := #in~cond; {4327#false} is VALID [2022-04-15 06:41:55,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {4327#false} assume 0 == ~cond; {4327#false} is VALID [2022-04-15 06:41:55,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {4327#false} assume !false; {4327#false} is VALID [2022-04-15 06:41:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:55,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:55,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {4327#false} assume !false; {4327#false} is VALID [2022-04-15 06:41:55,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {4327#false} assume 0 == ~cond; {4327#false} is VALID [2022-04-15 06:41:55,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {4327#false} ~cond := #in~cond; {4327#false} is VALID [2022-04-15 06:41:55,984 INFO L272 TraceCheckUtils]: 19: Hoare triple {4327#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4327#false} is VALID [2022-04-15 06:41:55,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {4327#false} assume !(~y~0 % 4294967296 > 0); {4327#false} is VALID [2022-04-15 06:41:55,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {4327#false} is VALID [2022-04-15 06:41:55,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#(<= 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; {4380#(<= (+ main_~y~0 1) (* (div (+ main_~y~0 1) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {4336#(<= 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; {4337#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:55,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {4447#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4336#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:55,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {4451#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 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; {4447#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:41:55,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {4326#true} ~z~0 := ~y~0; {4451#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:41:55,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {4326#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4326#true} is VALID [2022-04-15 06:41:55,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {4326#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_110 4294967296)) (.cse1 (= v_main_~y~0_112 v_main_~y~0_111)) (.cse2 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_109 v_main_~x~0_110) (= v_main_~y~0_111 (+ v_main_~x~0_110 v_main_~y~0_112 (* v_main_~x~0_109 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_109 v_it_12 1) v_main_~x~0_110)) (< 0 (mod (+ v_main_~x~0_110 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0)) (and (= v_main_~x~0_110 v_main_~x~0_109) .cse1 .cse2 .cse3) (and (<= .cse0 0) .cse1 (= v_main_~x~0_109 v_main_~x~0_110) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_112, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4326#true} is VALID [2022-04-15 06:41:55,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {4326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4326#true} is VALID [2022-04-15 06:41:55,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {4326#true} call #t~ret17 := main(); {4326#true} is VALID [2022-04-15 06:41:55,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4326#true} {4326#true} #94#return; {4326#true} is VALID [2022-04-15 06:41:55,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {4326#true} assume true; {4326#true} is VALID [2022-04-15 06:41:55,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {4326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4326#true} is VALID [2022-04-15 06:41:55,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {4326#true} call ULTIMATE.init(); {4326#true} is VALID [2022-04-15 06:41:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:55,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096022194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:55,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:55,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-04-15 06:41:56,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:56,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543354202] [2022-04-15 06:41:56,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543354202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:56,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:56,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:41:56,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904837379] [2022-04-15 06:41:56,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:56,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:41:56,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:56,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:56,928 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:41:56,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:41:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:41:56,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:41:56,928 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:04,469 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2022-04-15 06:42:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:42:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:42:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 06:42:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 06:42:04,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-15 06:42:05,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:05,322 INFO L225 Difference]: With dead ends: 89 [2022-04-15 06:42:05,322 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:42:05,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:42:05,323 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:05,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 115 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-04-15 06:42:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:42:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-15 06:42:05,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:05,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:05,555 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:05,555 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:05,556 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-15 06:42:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-15 06:42:05,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:05,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:05,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 06:42:05,557 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 06:42:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:05,557 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-15 06:42:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-15 06:42:05,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:05,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:05,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:05,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2022-04-15 06:42:05,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 23 [2022-04-15 06:42:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:05,559 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2022-04-15 06:42:05,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:05,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 77 transitions. [2022-04-15 06:42:10,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 75 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2022-04-15 06:42:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:42:10,002 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:10,002 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:10,022 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:10,202 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:10,202 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1015896408, now seen corresponding path program 1 times [2022-04-15 06:42:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:10,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172954937] [2022-04-15 06:42:10,415 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:10,417 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash -435835561, now seen corresponding path program 1 times [2022-04-15 06:42:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:10,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156463092] [2022-04-15 06:42:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:10,432 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:42:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,456 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:42:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {4937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-15 06:42:10,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-15 06:42:10,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-15 06:42:10,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {4928#true} call ULTIMATE.init(); {4937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:10,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {4937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-15 06:42:10,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-15 06:42:10,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-15 06:42:10,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {4928#true} call #t~ret17 := main(); {4928#true} is VALID [2022-04-15 06:42:10,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {4928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4928#true} is VALID [2022-04-15 06:42:10,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {4928#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_119 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse3 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse4 (= v_main_~x~0_119 v_main_~x~0_118))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< 0 .cse1) (= v_main_~y~0_126 (+ v_main_~x~0_119 (* v_main_~x~0_118 (- 1)) v_main_~y~0_127)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~x~0_118 v_it_13 1) v_main_~x~0_119)) (< 0 (mod (+ v_main_~x~0_119 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_118 v_main_~x~0_119)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4928#true} is VALID [2022-04-15 06:42:10,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {4928#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4928#true} is VALID [2022-04-15 06:42:10,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {4928#true} ~z~0 := ~y~0; {4933#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:42:10,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {4933#(= (+ 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; {4934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:10,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {4934#(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; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:10,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:10,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:10,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#(<= 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; {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:10,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#false} assume !(~x~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4929#false} is VALID [2022-04-15 06:42:10,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {4929#false} assume !(~z~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {4929#false} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,510 INFO L272 TraceCheckUtils]: 19: Hoare triple {4929#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4929#false} is VALID [2022-04-15 06:42:10,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {4929#false} ~cond := #in~cond; {4929#false} is VALID [2022-04-15 06:42:10,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {4929#false} assume 0 == ~cond; {4929#false} is VALID [2022-04-15 06:42:10,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {4929#false} assume !false; {4929#false} is VALID [2022-04-15 06:42:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:42:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:10,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156463092] [2022-04-15 06:42:10,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156463092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:10,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262243367] [2022-04-15 06:42:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:10,511 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:10,517 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:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:42:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:10,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {4928#true} call ULTIMATE.init(); {4928#true} is VALID [2022-04-15 06:42:10,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {4928#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-15 06:42:10,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-15 06:42:10,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-15 06:42:10,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {4928#true} call #t~ret17 := main(); {4928#true} is VALID [2022-04-15 06:42:10,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {4928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4928#true} is VALID [2022-04-15 06:42:10,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {4928#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_119 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse3 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse4 (= v_main_~x~0_119 v_main_~x~0_118))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< 0 .cse1) (= v_main_~y~0_126 (+ v_main_~x~0_119 (* v_main_~x~0_118 (- 1)) v_main_~y~0_127)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~x~0_118 v_it_13 1) v_main_~x~0_119)) (< 0 (mod (+ v_main_~x~0_119 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_118 v_main_~x~0_119)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4928#true} is VALID [2022-04-15 06:42:10,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {4928#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4928#true} is VALID [2022-04-15 06:42:10,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {4928#true} ~z~0 := ~y~0; {4933#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:42:10,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {4933#(= (+ 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; {4934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:10,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {4934#(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; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:10,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:10,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:10,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#(<= 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; {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#false} assume !(~x~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {4929#false} assume !(~z~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {4929#false} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L272 TraceCheckUtils]: 19: Hoare triple {4929#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {4929#false} ~cond := #in~cond; {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {4929#false} assume 0 == ~cond; {4929#false} is VALID [2022-04-15 06:42:10,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {4929#false} assume !false; {4929#false} is VALID [2022-04-15 06:42:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:42:10,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:11,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {4929#false} assume !false; {4929#false} is VALID [2022-04-15 06:42:11,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {4929#false} assume 0 == ~cond; {4929#false} is VALID [2022-04-15 06:42:11,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {4929#false} ~cond := #in~cond; {4929#false} is VALID [2022-04-15 06:42:11,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {4929#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4929#false} is VALID [2022-04-15 06:42:11,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {4929#false} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:11,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {4929#false} assume !(~z~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:11,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4929#false} is VALID [2022-04-15 06:42:11,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#false} assume !(~x~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:11,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4929#false} is VALID [2022-04-15 06:42:11,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#(<= 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; {4936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:11,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:11,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:11,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {5043#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:11,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {5047#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5043#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:42:11,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {4928#true} ~z~0 := ~y~0; {5047#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:11,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {4928#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4928#true} is VALID [2022-04-15 06:42:11,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {4928#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_119 4294967296)) (.cse0 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= |v_main_#t~post6_64| |v_main_#t~post6_63|)) (.cse3 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse4 (= v_main_~x~0_119 v_main_~x~0_118))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< 0 .cse1) (= v_main_~y~0_126 (+ v_main_~x~0_119 (* v_main_~x~0_118 (- 1)) v_main_~y~0_127)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~x~0_118 v_it_13 1) v_main_~x~0_119)) (< 0 (mod (+ v_main_~x~0_119 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_118 v_main_~x~0_119)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4928#true} is VALID [2022-04-15 06:42:11,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {4928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4928#true} is VALID [2022-04-15 06:42:11,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {4928#true} call #t~ret17 := main(); {4928#true} is VALID [2022-04-15 06:42:11,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4928#true} {4928#true} #94#return; {4928#true} is VALID [2022-04-15 06:42:11,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {4928#true} assume true; {4928#true} is VALID [2022-04-15 06:42:11,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {4928#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4928#true} is VALID [2022-04-15 06:42:11,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {4928#true} call ULTIMATE.init(); {4928#true} is VALID [2022-04-15 06:42:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:42:11,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262243367] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:11,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:11,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 06:42:11,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172954937] [2022-04-15 06:42:11,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172954937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:11,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:42:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530054365] [2022-04-15 06:42:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:11,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:42:11,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:11,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:11,194 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:42:11,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:42:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:42:11,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:42:11,195 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:11,861 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2022-04-15 06:42:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:42:11,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:42:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 06:42:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 06:42:11,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-15 06:42:11,910 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:42:11,910 INFO L225 Difference]: With dead ends: 77 [2022-04-15 06:42:11,911 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:42:11,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:42:11,911 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:11,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 49 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:42:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:42:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-04-15 06:42:12,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:12,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:12,128 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:12,129 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:12,129 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 06:42:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-15 06:42:12,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:12,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:12,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:42:12,130 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:42:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:12,131 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 06:42:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-15 06:42:12,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:12,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:12,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:12,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2022-04-15 06:42:12,132 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 23 [2022-04-15 06:42:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:12,132 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2022-04-15 06:42:12,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:12,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 57 transitions. [2022-04-15 06:42:17,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 55 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-04-15 06:42:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:42:17,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:17,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, 1, 1, 1, 1] [2022-04-15 06:42:17,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 06:42:17,518 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:42:17,518 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1809241787, now seen corresponding path program 1 times [2022-04-15 06:42:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:17,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466953643] [2022-04-15 06:42:21,629 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:21,725 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:21,727 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1144182118, now seen corresponding path program 1 times [2022-04-15 06:42:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:21,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943461442] [2022-04-15 06:42:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:21,737 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:42:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,757 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-15 06:42:21,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-15 06:42:21,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-15 06:42:21,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {5442#true} call ULTIMATE.init(); {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:21,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-15 06:42:21,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-15 06:42:21,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-15 06:42:21,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {5442#true} call #t~ret17 := main(); {5442#true} is VALID [2022-04-15 06:42:21,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {5442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5447#(= main_~y~0 0)} is VALID [2022-04-15 06:42:21,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {5447#(= main_~y~0 0)} [124] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse0 (mod v_main_~x~0_130 4294967296)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_129 v_it_14 1) v_main_~x~0_130)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_14)) 4294967296)) (not (<= 1 v_it_14)))) (= v_main_~y~0_135 (+ v_main_~x~0_130 v_main_~y~0_136 (* v_main_~x~0_129 (- 1)))) (< 0 .cse0) (< v_main_~x~0_129 v_main_~x~0_130)) (and .cse1 (= v_main_~x~0_130 v_main_~x~0_129) .cse2 .cse3) (and (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5448#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:42:21,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {5448#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5449#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-15 06:42:21,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {5449#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {5450#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 06:42:21,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {5450#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5442#true} is VALID [2022-04-15 06:42:21,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {5442#true} assume !(~z~0 % 4294967296 > 0); {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:42:21,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:42:21,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:42:21,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:42:21,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:42:21,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {5452#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:42:21,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {5451#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5443#false} is VALID [2022-04-15 06:42:21,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {5443#false} assume !(~z~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-15 06:42:21,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {5443#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5443#false} is VALID [2022-04-15 06:42:21,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {5443#false} assume !(~y~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-15 06:42:21,925 INFO L272 TraceCheckUtils]: 20: Hoare triple {5443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5443#false} is VALID [2022-04-15 06:42:21,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {5443#false} ~cond := #in~cond; {5443#false} is VALID [2022-04-15 06:42:21,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {5443#false} assume 0 == ~cond; {5443#false} is VALID [2022-04-15 06:42:21,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {5443#false} assume !false; {5443#false} is VALID [2022-04-15 06:42:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:42:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:21,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943461442] [2022-04-15 06:42:21,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943461442] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:21,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682135632] [2022-04-15 06:42:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:21,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:21,927 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:42:21,928 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:42:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:42:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:22,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {5442#true} call ULTIMATE.init(); {5442#true} is VALID [2022-04-15 06:42:22,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-15 06:42:22,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-15 06:42:22,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-15 06:42:22,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {5442#true} call #t~ret17 := main(); {5442#true} is VALID [2022-04-15 06:42:22,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {5442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5442#true} is VALID [2022-04-15 06:42:22,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {5442#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse0 (mod v_main_~x~0_130 4294967296)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_129 v_it_14 1) v_main_~x~0_130)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_14)) 4294967296)) (not (<= 1 v_it_14)))) (= v_main_~y~0_135 (+ v_main_~x~0_130 v_main_~y~0_136 (* v_main_~x~0_129 (- 1)))) (< 0 .cse0) (< v_main_~x~0_129 v_main_~x~0_130)) (and .cse1 (= v_main_~x~0_130 v_main_~x~0_129) .cse2 .cse3) (and (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5442#true} is VALID [2022-04-15 06:42:22,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {5442#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5442#true} is VALID [2022-04-15 06:42:22,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {5442#true} ~z~0 := ~y~0; {5481#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:22,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {5481#(= 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; {5485#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:22,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {5485#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {5485#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:22,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {5485#(= 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; {5492#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:42:22,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {5492#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {5492#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:42:22,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {5492#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5481#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:22,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {5481#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {5481#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:22,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {5481#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5485#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:22,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {5485#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:22,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:22,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5515#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:22,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-15 06:42:22,081 INFO L272 TraceCheckUtils]: 20: Hoare triple {5443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5443#false} is VALID [2022-04-15 06:42:22,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {5443#false} ~cond := #in~cond; {5443#false} is VALID [2022-04-15 06:42:22,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {5443#false} assume 0 == ~cond; {5443#false} is VALID [2022-04-15 06:42:22,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {5443#false} assume !false; {5443#false} is VALID [2022-04-15 06:42:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:22,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:22,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {5443#false} assume !false; {5443#false} is VALID [2022-04-15 06:42:22,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {5443#false} assume 0 == ~cond; {5443#false} is VALID [2022-04-15 06:42:22,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {5443#false} ~cond := #in~cond; {5443#false} is VALID [2022-04-15 06:42:22,248 INFO L272 TraceCheckUtils]: 20: Hoare triple {5443#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5443#false} is VALID [2022-04-15 06:42:22,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5443#false} is VALID [2022-04-15 06:42:22,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {5515#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:22,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:22,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5508#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:22,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:42:22,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:22,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:22,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:22,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5563#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:22,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:42:22,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {5556#(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; {5552#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:42:22,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {5442#true} ~z~0 := ~y~0; {5556#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:22,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {5442#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5442#true} is VALID [2022-04-15 06:42:22,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {5442#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse0 (mod v_main_~x~0_130 4294967296)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_129 v_it_14 1) v_main_~x~0_130)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_14)) 4294967296)) (not (<= 1 v_it_14)))) (= v_main_~y~0_135 (+ v_main_~x~0_130 v_main_~y~0_136 (* v_main_~x~0_129 (- 1)))) (< 0 .cse0) (< v_main_~x~0_129 v_main_~x~0_130)) (and .cse1 (= v_main_~x~0_130 v_main_~x~0_129) .cse2 .cse3) (and (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5442#true} is VALID [2022-04-15 06:42:22,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {5442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5442#true} is VALID [2022-04-15 06:42:22,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {5442#true} call #t~ret17 := main(); {5442#true} is VALID [2022-04-15 06:42:22,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5442#true} {5442#true} #94#return; {5442#true} is VALID [2022-04-15 06:42:22,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {5442#true} assume true; {5442#true} is VALID [2022-04-15 06:42:22,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {5442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5442#true} is VALID [2022-04-15 06:42:22,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {5442#true} call ULTIMATE.init(); {5442#true} is VALID [2022-04-15 06:42:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:22,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682135632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:22,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:22,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2022-04-15 06:42:22,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:22,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466953643] [2022-04-15 06:42:22,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466953643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:22,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:22,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:42:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977152993] [2022-04-15 06:42:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:22,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 06:42:22,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:22,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:22,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:22,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:42:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:22,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:42:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:42:22,611 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,630 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-04-15 06:42:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:42:23,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 06:42:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 06:42:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 06:42:23,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-15 06:42:23,925 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:23,926 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:42:23,926 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 06:42:23,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:42:23,927 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:23,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 75 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-04-15 06:42:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 06:42:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2022-04-15 06:42:24,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:24,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:24,126 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:24,126 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:24,127 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-15 06:42:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-04-15 06:42:24,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:24,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:24,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:42:24,128 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:42:24,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:24,129 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-15 06:42:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-04-15 06:42:24,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:24,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:24,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:24,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-15 06:42:24,131 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 24 [2022-04-15 06:42:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:24,131 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-15 06:42:24,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:24,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 46 transitions. [2022-04-15 06:42:28,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 44 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-15 06:42:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:42:28,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:28,792 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:28,809 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:42:28,992 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:42:28,992 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1625331179, now seen corresponding path program 2 times [2022-04-15 06:42:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:28,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [845295508] [2022-04-15 06:42:31,226 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:31,227 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1323332873, now seen corresponding path program 1 times [2022-04-15 06:42:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:31,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548541448] [2022-04-15 06:42:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:31,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:31,237 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:42:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,245 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:42:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {5957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-15 06:42:31,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-15 06:42:31,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-15 06:42:31,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:31,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {5957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-15 06:42:31,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-15 06:42:31,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-15 06:42:31,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret17 := main(); {5948#true} is VALID [2022-04-15 06:42:31,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5948#true} is VALID [2022-04-15 06:42:31,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {5948#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_142 4294967296)) (.cse1 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= v_main_~y~0_148 (+ v_main_~x~0_142 (* v_main_~x~0_141 (- 1)) v_main_~y~0_149)) (< 0 .cse0) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_142 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~x~0_141 v_it_15 1) v_main_~x~0_142)) (not (<= 1 v_it_15)))) (< v_main_~x~0_141 v_main_~x~0_142)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5948#true} is VALID [2022-04-15 06:42:31,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5953#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:31,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {5953#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5953#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:31,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {5953#(<= 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; {5954#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:31,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {5954#(<= 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; {5955#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:31,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {5955#(<= 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; {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:31,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:31,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:31,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:31,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:31,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {5956#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {5949#false} assume !(~z~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {5949#false} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,303 INFO L272 TraceCheckUtils]: 19: Hoare triple {5949#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5949#false} is VALID [2022-04-15 06:42:31,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {5949#false} ~cond := #in~cond; {5949#false} is VALID [2022-04-15 06:42:31,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {5949#false} assume 0 == ~cond; {5949#false} is VALID [2022-04-15 06:42:31,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-04-15 06:42:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:31,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548541448] [2022-04-15 06:42:31,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548541448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:31,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939293730] [2022-04-15 06:42:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:31,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:31,305 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:42:31,310 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:42:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:42:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:31,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5948#true} is VALID [2022-04-15 06:42:31,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-15 06:42:31,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-15 06:42:31,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-15 06:42:31,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret17 := main(); {5948#true} is VALID [2022-04-15 06:42:31,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5948#true} is VALID [2022-04-15 06:42:31,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {5948#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_142 4294967296)) (.cse1 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= v_main_~y~0_148 (+ v_main_~x~0_142 (* v_main_~x~0_141 (- 1)) v_main_~y~0_149)) (< 0 .cse0) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_142 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~x~0_141 v_it_15 1) v_main_~x~0_142)) (not (<= 1 v_it_15)))) (< v_main_~x~0_141 v_main_~x~0_142)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5948#true} is VALID [2022-04-15 06:42:31,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5948#true} is VALID [2022-04-15 06:42:31,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {5948#true} ~z~0 := ~y~0; {5985#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:31,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {5985#(= 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; {5989#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:31,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {5989#(= 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; {5993#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:42:31,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {5993#(= 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; {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:42:31,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:42:31,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {5997#(< 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; {6004#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:31,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {6004#(< 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; {6008#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:31,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {6008#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {5949#false} assume !(~x~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {5949#false} assume !(~z~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {5949#false} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,453 INFO L272 TraceCheckUtils]: 19: Hoare triple {5949#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5949#false} is VALID [2022-04-15 06:42:31,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {5949#false} ~cond := #in~cond; {5949#false} is VALID [2022-04-15 06:42:31,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {5949#false} assume 0 == ~cond; {5949#false} is VALID [2022-04-15 06:42:31,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-04-15 06:42:31,454 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:31,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:31,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2022-04-15 06:42:31,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {5949#false} assume 0 == ~cond; {5949#false} is VALID [2022-04-15 06:42:31,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {5949#false} ~cond := #in~cond; {5949#false} is VALID [2022-04-15 06:42:31,589 INFO L272 TraceCheckUtils]: 19: Hoare triple {5949#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5949#false} is VALID [2022-04-15 06:42:31,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {5949#false} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {5949#false} assume !(~z~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {5949#false} assume !(~x~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {6008#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5949#false} is VALID [2022-04-15 06:42:31,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {6004#(< 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; {6008#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:31,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {5997#(< 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; {6004#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:31,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:42:31,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {6066#(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; {5997#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:42:31,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {6070#(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; {6066#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:42:31,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {6074#(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; {6070#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:42:31,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {5948#true} ~z~0 := ~y~0; {6074#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:42:31,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5948#true} is VALID [2022-04-15 06:42:31,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {5948#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_142 4294967296)) (.cse1 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= v_main_~y~0_148 (+ v_main_~x~0_142 (* v_main_~x~0_141 (- 1)) v_main_~y~0_149)) (< 0 .cse0) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_142 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~x~0_141 v_it_15 1) v_main_~x~0_142)) (not (<= 1 v_it_15)))) (< v_main_~x~0_141 v_main_~x~0_142)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5948#true} is VALID [2022-04-15 06:42:31,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5948#true} is VALID [2022-04-15 06:42:31,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret17 := main(); {5948#true} is VALID [2022-04-15 06:42:31,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #94#return; {5948#true} is VALID [2022-04-15 06:42:31,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2022-04-15 06:42:31,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {5948#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5948#true} is VALID [2022-04-15 06:42:31,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5948#true} is VALID [2022-04-15 06:42:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:31,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939293730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:31,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:31,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-04-15 06:42:31,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:31,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [845295508] [2022-04-15 06:42:31,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [845295508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:31,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:31,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:42:31,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141442111] [2022-04-15 06:42:31,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:42:31,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:31,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:42:31,729 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:42:31,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:42:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:42:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:42:31,730 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:42:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:32,874 INFO L93 Difference]: Finished difference Result 107 states and 158 transitions. [2022-04-15 06:42:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:42:32,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:42:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:42:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-15 06:42:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:42:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-15 06:42:32,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2022-04-15 06:42:32,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:32,950 INFO L225 Difference]: With dead ends: 107 [2022-04-15 06:42:32,950 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 06:42:32,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:42:32,951 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:32,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 06:42:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 44. [2022-04-15 06:42:33,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:33,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:33,099 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:33,099 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:33,100 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-04-15 06:42:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-04-15 06:42:33,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:33,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:33,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:42:33,101 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:42:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:33,102 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2022-04-15 06:42:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-04-15 06:42:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:33,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:33,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:33,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-04-15 06:42:33,103 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 24 [2022-04-15 06:42:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:33,103 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-04-15 06:42:33,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:42:33,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 59 transitions. [2022-04-15 06:42:39,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 56 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-04-15 06:42:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:42:39,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:39,584 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:39,600 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:42:39,785 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:42:39,785 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash -529458535, now seen corresponding path program 2 times [2022-04-15 06:42:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:39,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142621518] [2022-04-15 06:42:39,980 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:39,982 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash 955029047, now seen corresponding path program 1 times [2022-04-15 06:42:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:39,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580703885] [2022-04-15 06:42:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:39,992 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:42:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,009 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:42:40,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {6623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-15 06:42:40,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-15 06:42:40,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:40,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {6623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {6614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {6614#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_153 4294967296)) (.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse4 (= |v_main_#t~post5_79| |v_main_#t~post5_78|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (= v_main_~y~0_160 (+ v_main_~x~0_153 (* v_main_~x~0_152 (- 1)) v_main_~y~0_161)) (< v_main_~x~0_152 v_main_~x~0_153) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_152 v_it_16 1) v_main_~x~0_153))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6614#true} is VALID [2022-04-15 06:42:40,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#true} ~z~0 := ~y~0; {6614#true} is VALID [2022-04-15 06:42:40,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {6614#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6619#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:40,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {6619#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:42:40,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:42:40,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {6620#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6621#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:40,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {6621#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:40,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:40,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:40,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:40,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:40,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {6622#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-15 06:42:40,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {6615#false} assume !(~y~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-15 06:42:40,072 INFO L272 TraceCheckUtils]: 20: Hoare triple {6615#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6615#false} is VALID [2022-04-15 06:42:40,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-15 06:42:40,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-15 06:42:40,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-15 06:42:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:40,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:40,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580703885] [2022-04-15 06:42:40,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580703885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:40,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241115974] [2022-04-15 06:42:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:40,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:40,073 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:42:40,074 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:42:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:42:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:40,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:40,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2022-04-15 06:42:40,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-15 06:42:40,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-15 06:42:40,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-15 06:42:40,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2022-04-15 06:42:40,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {6614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6614#true} is VALID [2022-04-15 06:42:40,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {6614#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_153 4294967296)) (.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse4 (= |v_main_#t~post5_79| |v_main_#t~post5_78|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (= v_main_~y~0_160 (+ v_main_~x~0_153 (* v_main_~x~0_152 (- 1)) v_main_~y~0_161)) (< v_main_~x~0_152 v_main_~x~0_153) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_152 v_it_16 1) v_main_~x~0_153))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6614#true} is VALID [2022-04-15 06:42:40,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6614#true} is VALID [2022-04-15 06:42:40,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#true} ~z~0 := ~y~0; {6651#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:40,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {6651#(= 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; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {6655#(< 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; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:42:40,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:40,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:40,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:42:40,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-15 06:42:40,216 INFO L272 TraceCheckUtils]: 20: Hoare triple {6615#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6615#false} is VALID [2022-04-15 06:42:40,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-15 06:42:40,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-15 06:42:40,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-15 06:42:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:42:40,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:40,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-15 06:42:40,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-15 06:42:40,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-15 06:42:40,307 INFO L272 TraceCheckUtils]: 20: Hoare triple {6615#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6615#false} is VALID [2022-04-15 06:42:40,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6615#false} is VALID [2022-04-15 06:42:40,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:42:40,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:40,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:40,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:42:40,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {6655#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {6655#(< 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; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {6742#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6655#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:40,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#true} ~z~0 := ~y~0; {6742#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:40,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {6614#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_153 4294967296)) (.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse4 (= |v_main_#t~post5_79| |v_main_#t~post5_78|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (= v_main_~y~0_160 (+ v_main_~x~0_153 (* v_main_~x~0_152 (- 1)) v_main_~y~0_161)) (< v_main_~x~0_152 v_main_~x~0_153) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_152 v_it_16 1) v_main_~x~0_153))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {6614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {6614#true} call #t~ret17 := main(); {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6614#true} {6614#true} #94#return; {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2022-04-15 06:42:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:42:40,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241115974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:40,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:40,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 06:42:40,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:40,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142621518] [2022-04-15 06:42:40,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142621518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:40,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:40,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:42:40,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638582372] [2022-04-15 06:42:40,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:42:40,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:40,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:40,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:40,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:42:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:42:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:42:40,410 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:41,811 INFO L93 Difference]: Finished difference Result 103 states and 147 transitions. [2022-04-15 06:42:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:42:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:42:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2022-04-15 06:42:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 88 transitions. [2022-04-15 06:42:41,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 88 transitions. [2022-04-15 06:42:41,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:41,911 INFO L225 Difference]: With dead ends: 103 [2022-04-15 06:42:41,911 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 06:42:41,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:42:41,912 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:41,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 52 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 06:42:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2022-04-15 06:42:42,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:42,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:42,281 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:42,281 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:42,282 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2022-04-15 06:42:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-04-15 06:42:42,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:42,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:42,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:42:42,283 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:42:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:42,284 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2022-04-15 06:42:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-04-15 06:42:42,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:42,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:42,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:42,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2022-04-15 06:42:42,285 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 25 [2022-04-15 06:42:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:42,285 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2022-04-15 06:42:42,285 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:42,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 81 transitions. [2022-04-15 06:42:48,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 79 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2022-04-15 06:42:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:42:48,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:48,668 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:48,687 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:42:48,868 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:42:48,868 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1702758372, now seen corresponding path program 3 times [2022-04-15 06:42:48,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:48,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476129046] [2022-04-15 06:42:49,051 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,053 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1089112006, now seen corresponding path program 1 times [2022-04-15 06:42:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:49,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976769728] [2022-04-15 06:42:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:49,063 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:42:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,088 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {7326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-15 06:42:49,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-15 06:42:49,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-15 06:42:49,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:49,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {7326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-15 06:42:49,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-15 06:42:49,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-15 06:42:49,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret17 := main(); {7315#true} is VALID [2022-04-15 06:42:49,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#true} is VALID [2022-04-15 06:42:49,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (= v_main_~x~0_164 (+ v_main_~x~0_165 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_17 1) v_main_~y~0_176)) (not (<= 1 v_it_17)))) (< 0 .cse2) (< v_main_~y~0_177 v_main_~y~0_176)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7315#true} is VALID [2022-04-15 06:42:49,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7315#true} is VALID [2022-04-15 06:42:49,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} ~z~0 := ~y~0; {7320#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:49,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {7320#(= 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; {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:42:49,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:49,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7323#(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:42:49,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {7323#(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; {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:49,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {7324#(<= 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; {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:49,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#(<= 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; {7316#false} is VALID [2022-04-15 06:42:49,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {7316#false} assume !(~x~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {7316#false} assume !(~z~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L272 TraceCheckUtils]: 21: Hoare triple {7316#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-15 06:42:49,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-15 06:42:49,199 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:42:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976769728] [2022-04-15 06:42:49,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976769728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146861717] [2022-04-15 06:42:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:49,201 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:42:49,214 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:42:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:42:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:49,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-15 06:42:49,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-15 06:42:49,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-15 06:42:49,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-15 06:42:49,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret17 := main(); {7315#true} is VALID [2022-04-15 06:42:49,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#true} is VALID [2022-04-15 06:42:49,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (= v_main_~x~0_164 (+ v_main_~x~0_165 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_17 1) v_main_~y~0_176)) (not (<= 1 v_it_17)))) (< 0 .cse2) (< v_main_~y~0_177 v_main_~y~0_176)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7315#true} is VALID [2022-04-15 06:42:49,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7315#true} is VALID [2022-04-15 06:42:49,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} ~z~0 := ~y~0; {7320#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:49,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {7320#(= 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; {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:42:49,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {7321#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:49,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {7322#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7363#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 06:42:49,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {7363#(<= (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; {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:49,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {7324#(<= 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; {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:49,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#(<= 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; {7316#false} is VALID [2022-04-15 06:42:49,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-15 06:42:49,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-15 06:42:49,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {7316#false} assume !(~x~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {7316#false} assume !(~z~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,552 INFO L272 TraceCheckUtils]: 21: Hoare triple {7316#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7316#false} is VALID [2022-04-15 06:42:49,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-15 06:42:49,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-15 06:42:49,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-15 06:42:49,553 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:42:49,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L272 TraceCheckUtils]: 21: Hoare triple {7316#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {7316#false} assume !(~z~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {7316#false} assume !(~x~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-15 06:42:49,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {7316#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7316#false} is VALID [2022-04-15 06:42:49,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {7316#false} assume !(~y~0 % 4294967296 > 0); {7316#false} is VALID [2022-04-15 06:42:49,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {7325#(<= 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; {7316#false} is VALID [2022-04-15 06:42:49,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {7324#(<= 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; {7325#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:49,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {7363#(<= (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; {7324#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:49,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {7442#(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); {7363#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 06:42:49,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {7446#(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; {7442#(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:42:49,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {7450#(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; {7446#(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:42:49,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} ~z~0 := ~y~0; {7450#(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:42:49,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7315#true} is VALID [2022-04-15 06:42:49,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (= v_main_~x~0_164 (+ v_main_~x~0_165 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_17 1) v_main_~y~0_176)) (not (<= 1 v_it_17)))) (< 0 .cse2) (< v_main_~y~0_177 v_main_~y~0_176)) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7315#true} is VALID [2022-04-15 06:42:49,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#true} is VALID [2022-04-15 06:42:49,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret17 := main(); {7315#true} is VALID [2022-04-15 06:42:49,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #94#return; {7315#true} is VALID [2022-04-15 06:42:49,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-15 06:42:49,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7315#true} is VALID [2022-04-15 06:42:49,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-15 06:42:49,981 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:42:49,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146861717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:49,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:49,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-15 06:42:50,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476129046] [2022-04-15 06:42:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476129046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:50,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:50,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:42:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649916933] [2022-04-15 06:42:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:50,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:42:50,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:50,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:50,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:50,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:42:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:42:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:42:50,055 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:51,325 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-15 06:42:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:42:51,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:42:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2022-04-15 06:42:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2022-04-15 06:42:51,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 77 transitions. [2022-04-15 06:42:51,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:51,403 INFO L225 Difference]: With dead ends: 81 [2022-04-15 06:42:51,403 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:42:51,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:42:51,404 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:51,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 53 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:42:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-04-15 06:42:51,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:51,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,726 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,726 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:51,728 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2022-04-15 06:42:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2022-04-15 06:42:51,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:51,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:51,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 06:42:51,728 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 06:42:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:51,729 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2022-04-15 06:42:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2022-04-15 06:42:51,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:51,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:51,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:51,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2022-04-15 06:42:51,730 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 26 [2022-04-15 06:42:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:51,731 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2022-04-15 06:42:51,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:51,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 75 transitions. [2022-04-15 06:42:56,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-15 06:42:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:42:56,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:56,808 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:56,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:42:57,008 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:42:57,008 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1041168377, now seen corresponding path program 3 times [2022-04-15 06:42:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:57,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208093487] [2022-04-15 06:42:57,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:42:57,191 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 986375319, now seen corresponding path program 1 times [2022-04-15 06:42:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:57,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904026595] [2022-04-15 06:42:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:57,201 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:57,222 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:57,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {7932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-15 06:42:57,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-15 06:42:57,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-15 06:42:57,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {7924#true} call ULTIMATE.init(); {7932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:57,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {7932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {7924#true} call #t~ret17 := main(); {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {7924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {7924#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~x~0_176 v_it_18 1) v_main_~x~0_177)) (not (<= 1 v_it_18)))) (= v_main_~y~0_192 (+ v_main_~x~0_177 v_main_~y~0_193 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {7924#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {7924#true} ~z~0 := ~y~0; {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {7924#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {7924#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {7924#true} assume !(~z~0 % 4294967296 > 0); {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {7924#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7924#true} is VALID [2022-04-15 06:42:57,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {7924#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7924#true} is VALID [2022-04-15 06:42:57,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {7924#true} assume !(~y~0 % 4294967296 > 0); {7929#(<= (* (div (+ main_~y~0 4294967295) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-15 06:42:57,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {7929#(<= (* (div (+ main_~y~0 4294967295) 4294967296) 4294967296) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7930#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:57,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {7930#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 06:42:57,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 06:42:57,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 06:42:57,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 06:42:57,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} is VALID [2022-04-15 06:42:57,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {7931#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 2) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7925#false} is VALID [2022-04-15 06:42:57,267 INFO L272 TraceCheckUtils]: 22: Hoare triple {7925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7925#false} is VALID [2022-04-15 06:42:57,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {7925#false} ~cond := #in~cond; {7925#false} is VALID [2022-04-15 06:42:57,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {7925#false} assume 0 == ~cond; {7925#false} is VALID [2022-04-15 06:42:57,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {7925#false} assume !false; {7925#false} is VALID [2022-04-15 06:42:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:57,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904026595] [2022-04-15 06:42:57,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904026595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:57,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445943746] [2022-04-15 06:42:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:57,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:57,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:57,277 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:42:57,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:42:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:57,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:42:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:57,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:57,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {7924#true} call ULTIMATE.init(); {7924#true} is VALID [2022-04-15 06:42:57,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {7924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-15 06:42:57,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-15 06:42:57,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-15 06:42:57,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {7924#true} call #t~ret17 := main(); {7924#true} is VALID [2022-04-15 06:42:57,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {7924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7924#true} is VALID [2022-04-15 06:42:57,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {7924#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~x~0_176 v_it_18 1) v_main_~x~0_177)) (not (<= 1 v_it_18)))) (= v_main_~y~0_192 (+ v_main_~x~0_177 v_main_~y~0_193 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7924#true} is VALID [2022-04-15 06:42:57,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {7924#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7924#true} is VALID [2022-04-15 06:42:57,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {7924#true} ~z~0 := ~y~0; {7960#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:57,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {7960#(= 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; {7964#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 06:42:57,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {7964#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:57,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:57,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {7968#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7975#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:42:57,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {7975#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:57,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:57,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:42:57,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7925#false} is VALID [2022-04-15 06:42:57,536 INFO L272 TraceCheckUtils]: 22: Hoare triple {7925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7925#false} is VALID [2022-04-15 06:42:57,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {7925#false} ~cond := #in~cond; {7925#false} is VALID [2022-04-15 06:42:57,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {7925#false} assume 0 == ~cond; {7925#false} is VALID [2022-04-15 06:42:57,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {7925#false} assume !false; {7925#false} is VALID [2022-04-15 06:42:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:57,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:57,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {7925#false} assume !false; {7925#false} is VALID [2022-04-15 06:42:57,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {7925#false} assume 0 == ~cond; {7925#false} is VALID [2022-04-15 06:42:57,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {7925#false} ~cond := #in~cond; {7925#false} is VALID [2022-04-15 06:42:57,634 INFO L272 TraceCheckUtils]: 22: Hoare triple {7925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7925#false} is VALID [2022-04-15 06:42:57,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7925#false} is VALID [2022-04-15 06:42:57,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:42:57,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:57,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7979#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:42:57,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7986#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:42:57,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {7990#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {7990#(< 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; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {8066#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7990#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:42:57,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {7924#true} ~z~0 := ~y~0; {8066#(or (<= (mod main_~z~0 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:57,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {7924#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {7924#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~x~0_176 v_it_18 1) v_main_~x~0_177)) (not (<= 1 v_it_18)))) (= v_main_~y~0_192 (+ v_main_~x~0_177 v_main_~y~0_193 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {7924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {7924#true} call #t~ret17 := main(); {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7924#true} {7924#true} #94#return; {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {7924#true} assume true; {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {7924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {7924#true} call ULTIMATE.init(); {7924#true} is VALID [2022-04-15 06:42:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:42:57,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445943746] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:57,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:57,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2022-04-15 06:42:57,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208093487] [2022-04-15 06:42:57,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208093487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:57,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:57,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:42:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580689430] [2022-04-15 06:42:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:57,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:42:57,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:57,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:57,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:57,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:42:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:42:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:42:57,736 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:59,043 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2022-04-15 06:42:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:42:59,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:42:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-15 06:42:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-15 06:42:59,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 85 transitions. [2022-04-15 06:42:59,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:59,151 INFO L225 Difference]: With dead ends: 97 [2022-04-15 06:42:59,151 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 06:42:59,152 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:42:59,153 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:59,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 39 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:42:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 06:42:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2022-04-15 06:42:59,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:59,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,459 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,459 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:59,464 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2022-04-15 06:42:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2022-04-15 06:42:59,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:59,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:59,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-15 06:42:59,473 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-15 06:42:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:59,474 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2022-04-15 06:42:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2022-04-15 06:42:59,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:59,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:59,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:59,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-04-15 06:42:59,481 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 27 [2022-04-15 06:42:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:59,481 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-04-15 06:42:59,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:59,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 84 transitions. [2022-04-15 06:43:04,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 82 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-15 06:43:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:43:04,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:04,674 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:04,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 06:43:04,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-04-15 06:43:04,884 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1238601096, now seen corresponding path program 3 times [2022-04-15 06:43:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:04,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099722134] [2022-04-15 06:43:05,057 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:43:05,059 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1322784154, now seen corresponding path program 1 times [2022-04-15 06:43:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:05,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473625764] [2022-04-15 06:43:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:05,069 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:05,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:05,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {8638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-15 06:43:05,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-15 06:43:05,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-15 06:43:05,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {8628#true} call ULTIMATE.init(); {8638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:05,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {8638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-15 06:43:05,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-15 06:43:05,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-15 06:43:05,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {8628#true} call #t~ret17 := main(); {8628#true} is VALID [2022-04-15 06:43:05,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {8628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8628#true} is VALID [2022-04-15 06:43:05,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {8628#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse3 (= v_main_~x~0_191 v_main_~x~0_190)) (.cse4 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse2 (mod v_main_~x~0_191 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_190 v_main_~x~0_191) (= v_main_~y~0_208 (+ v_main_~x~0_191 v_main_~y~0_209 (* v_main_~x~0_190 (- 1)))) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_190 v_it_19 1) v_main_~x~0_191)) (< 0 (mod (+ v_main_~x~0_191 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_190, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8628#true} is VALID [2022-04-15 06:43:05,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {8628#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8633#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:05,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {8633#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8633#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:05,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {8633#(<= 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; {8634#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:05,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {8634#(<= 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; {8635#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:05,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {8635#(<= 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; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:05,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:05,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {8636#(<= 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; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:05,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {8636#(<= 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; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:05,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {8636#(<= 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; {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:05,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:05,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {8636#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8637#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:43:05,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {8637#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {8629#false} assume !(~z~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {8629#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {8629#false} assume !(~y~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L272 TraceCheckUtils]: 22: Hoare triple {8629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {8629#false} ~cond := #in~cond; {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {8629#false} assume 0 == ~cond; {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {8629#false} assume !false; {8629#false} is VALID [2022-04-15 06:43:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:43:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:05,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473625764] [2022-04-15 06:43:05,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473625764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:05,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382471517] [2022-04-15 06:43:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:05,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:05,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:05,156 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:43:05,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 06:43:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:05,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:43:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:05,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:05,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {8628#true} call ULTIMATE.init(); {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {8628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {8628#true} call #t~ret17 := main(); {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {8628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {8628#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse3 (= v_main_~x~0_191 v_main_~x~0_190)) (.cse4 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse2 (mod v_main_~x~0_191 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_190 v_main_~x~0_191) (= v_main_~y~0_208 (+ v_main_~x~0_191 v_main_~y~0_209 (* v_main_~x~0_190 (- 1)))) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_190 v_it_19 1) v_main_~x~0_191)) (< 0 (mod (+ v_main_~x~0_191 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_190, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {8628#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8628#true} is VALID [2022-04-15 06:43:05,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {8628#true} ~z~0 := ~y~0; {8666#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:05,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {8666#(= 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; {8670#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 06:43:05,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {8670#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8674#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 06:43:05,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {8674#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:05,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:05,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {8678#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8685#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 06:43:05,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {8685#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:05,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-15 06:43:05,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {8629#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8629#false} is VALID [2022-04-15 06:43:05,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {8629#false} assume !(~y~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-15 06:43:05,380 INFO L272 TraceCheckUtils]: 22: Hoare triple {8629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8629#false} is VALID [2022-04-15 06:43:05,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {8629#false} ~cond := #in~cond; {8629#false} is VALID [2022-04-15 06:43:05,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {8629#false} assume 0 == ~cond; {8629#false} is VALID [2022-04-15 06:43:05,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {8629#false} assume !false; {8629#false} is VALID [2022-04-15 06:43:05,380 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:43:05,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:05,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {8629#false} assume !false; {8629#false} is VALID [2022-04-15 06:43:05,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {8629#false} assume 0 == ~cond; {8629#false} is VALID [2022-04-15 06:43:05,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {8629#false} ~cond := #in~cond; {8629#false} is VALID [2022-04-15 06:43:05,496 INFO L272 TraceCheckUtils]: 22: Hoare triple {8629#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8629#false} is VALID [2022-04-15 06:43:05,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {8629#false} assume !(~y~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-15 06:43:05,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {8629#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {8629#false} is VALID [2022-04-15 06:43:05,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8629#false} is VALID [2022-04-15 06:43:05,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {8693#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8693#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:05,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:05,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:05,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:05,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8761#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:05,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8757#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:05,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {8628#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8689#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:05,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {8628#true} ~z~0 := ~y~0; {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {8628#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {8628#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse3 (= v_main_~x~0_191 v_main_~x~0_190)) (.cse4 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse2 (mod v_main_~x~0_191 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_190 v_main_~x~0_191) (= v_main_~y~0_208 (+ v_main_~x~0_191 v_main_~y~0_209 (* v_main_~x~0_190 (- 1)))) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_190 v_it_19 1) v_main_~x~0_191)) (< 0 (mod (+ v_main_~x~0_191 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_190, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {8628#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {8628#true} call #t~ret17 := main(); {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8628#true} {8628#true} #94#return; {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {8628#true} assume true; {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {8628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {8628#true} call ULTIMATE.init(); {8628#true} is VALID [2022-04-15 06:43:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:43:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382471517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:05,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:05,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 17 [2022-04-15 06:43:05,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:05,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099722134] [2022-04-15 06:43:05,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099722134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:05,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:05,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:43:05,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818663199] [2022-04-15 06:43:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:43:05,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:05,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:05,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:05,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:43:05,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:43:05,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:43:05,588 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:07,293 INFO L93 Difference]: Finished difference Result 175 states and 255 transitions. [2022-04-15 06:43:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:43:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:43:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-04-15 06:43:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-04-15 06:43:07,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 107 transitions. [2022-04-15 06:43:07,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:07,425 INFO L225 Difference]: With dead ends: 175 [2022-04-15 06:43:07,425 INFO L226 Difference]: Without dead ends: 152 [2022-04-15 06:43:07,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:43:07,426 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 121 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:07,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 65 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:43:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-15 06:43:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 75. [2022-04-15 06:43:07,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:07,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,721 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,721 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:07,723 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. [2022-04-15 06:43:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2022-04-15 06:43:07,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:07,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:07,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 152 states. [2022-04-15 06:43:07,724 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 152 states. [2022-04-15 06:43:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:07,725 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. [2022-04-15 06:43:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2022-04-15 06:43:07,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:07,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:07,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:07,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2022-04-15 06:43:07,727 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 27 [2022-04-15 06:43:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:07,727 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2022-04-15 06:43:07,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:07,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 100 transitions. [2022-04-15 06:43:13,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 98 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2022-04-15 06:43:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:43:13,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:13,277 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:13,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 06:43:13,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:13,478 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2049023563, now seen corresponding path program 2 times [2022-04-15 06:43:13,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:13,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1555554987] [2022-04-15 06:43:13,728 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:43:13,729 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash -242534313, now seen corresponding path program 1 times [2022-04-15 06:43:13,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:13,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661575672] [2022-04-15 06:43:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:13,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:13,745 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:13,764 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:13,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {9635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-15 06:43:13,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-15 06:43:13,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-15 06:43:13,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {9627#true} call ULTIMATE.init(); {9635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:13,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {9635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {9627#true} call #t~ret17 := main(); {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {9627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {9627#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse3 (= v_main_~y~0_224 v_main_~y~0_223)) (.cse4 (mod v_main_~x~0_203 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ v_main_~x~0_202 v_it_20 1) v_main_~x~0_203)))) (< v_main_~x~0_202 v_main_~x~0_203) (= v_main_~y~0_223 (+ v_main_~x~0_203 v_main_~y~0_224 (* v_main_~x~0_202 (- 1)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_224, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_223, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {9627#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {9627#true} ~z~0 := ~y~0; {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {9627#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {9627#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {9627#true} assume !(~z~0 % 4294967296 > 0); {9627#true} is VALID [2022-04-15 06:43:13,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {9627#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9627#true} is VALID [2022-04-15 06:43:13,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {9627#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:43:13,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:43:13,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {9632#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:13,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:13,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:13,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:13,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:13,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:13,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:13,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9628#false} is VALID [2022-04-15 06:43:13,831 INFO L272 TraceCheckUtils]: 23: Hoare triple {9628#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9628#false} is VALID [2022-04-15 06:43:13,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {9628#false} ~cond := #in~cond; {9628#false} is VALID [2022-04-15 06:43:13,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {9628#false} assume 0 == ~cond; {9628#false} is VALID [2022-04-15 06:43:13,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {9628#false} assume !false; {9628#false} is VALID [2022-04-15 06:43:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:43:13,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:13,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661575672] [2022-04-15 06:43:13,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661575672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:13,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774669273] [2022-04-15 06:43:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:13,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:13,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:13,845 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:43:13,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 06:43:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:13,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:43:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:13,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:14,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {9627#true} call ULTIMATE.init(); {9627#true} is VALID [2022-04-15 06:43:14,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {9627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-15 06:43:14,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-15 06:43:14,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-15 06:43:14,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {9627#true} call #t~ret17 := main(); {9627#true} is VALID [2022-04-15 06:43:14,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {9627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9627#true} is VALID [2022-04-15 06:43:14,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {9627#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse3 (= v_main_~y~0_224 v_main_~y~0_223)) (.cse4 (mod v_main_~x~0_203 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ v_main_~x~0_202 v_it_20 1) v_main_~x~0_203)))) (< v_main_~x~0_202 v_main_~x~0_203) (= v_main_~y~0_223 (+ v_main_~x~0_203 v_main_~y~0_224 (* v_main_~x~0_202 (- 1)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_224, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_223, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9627#true} is VALID [2022-04-15 06:43:14,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {9627#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9627#true} is VALID [2022-04-15 06:43:14,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {9627#true} ~z~0 := ~y~0; {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:14,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {9663#(= 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; {9667#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:14,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {9667#(= 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; {9671#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:43:14,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {9671#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {9671#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:43:14,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {9671#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:14,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {9663#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 06:43:14,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 06:43:14,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {9681#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9688#(= main_~y~0 (+ (- 1) main_~z~0))} is VALID [2022-04-15 06:43:14,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {9688#(= main_~y~0 (+ (- 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:14,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {9663#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {9663#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:14,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {9663#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9667#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:14,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {9667#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:14,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:14,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:14,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9628#false} is VALID [2022-04-15 06:43:14,177 INFO L272 TraceCheckUtils]: 23: Hoare triple {9628#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9628#false} is VALID [2022-04-15 06:43:14,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {9628#false} ~cond := #in~cond; {9628#false} is VALID [2022-04-15 06:43:14,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {9628#false} assume 0 == ~cond; {9628#false} is VALID [2022-04-15 06:43:14,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {9628#false} assume !false; {9628#false} is VALID [2022-04-15 06:43:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:14,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:14,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {9628#false} assume !false; {9628#false} is VALID [2022-04-15 06:43:14,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {9628#false} assume 0 == ~cond; {9628#false} is VALID [2022-04-15 06:43:14,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {9628#false} ~cond := #in~cond; {9628#false} is VALID [2022-04-15 06:43:14,596 INFO L272 TraceCheckUtils]: 23: Hoare triple {9628#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9628#false} is VALID [2022-04-15 06:43:14,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9628#false} is VALID [2022-04-15 06:43:14,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {9633#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:14,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:14,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9634#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:43:14,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:43:14,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:14,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {9754#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:14,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9754#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))))} is VALID [2022-04-15 06:43:14,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} assume !(~y~0 % 4294967296 > 0); {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-15 06:43:14,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {9765#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9758#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-15 06:43:14,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9765#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:43:14,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-15 06:43:14,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9769#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod (+ main_~z~0 1) 4294967296))))} is VALID [2022-04-15 06:43:14,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9743#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:43:14,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {9627#true} ~z~0 := ~y~0; {9747#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:14,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {9627#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9627#true} is VALID [2022-04-15 06:43:14,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {9627#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse3 (= v_main_~y~0_224 v_main_~y~0_223)) (.cse4 (mod v_main_~x~0_203 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ v_main_~x~0_202 v_it_20 1) v_main_~x~0_203)))) (< v_main_~x~0_202 v_main_~x~0_203) (= v_main_~y~0_223 (+ v_main_~x~0_203 v_main_~y~0_224 (* v_main_~x~0_202 (- 1)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_224, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_223, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9627#true} is VALID [2022-04-15 06:43:14,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {9627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9627#true} is VALID [2022-04-15 06:43:14,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {9627#true} call #t~ret17 := main(); {9627#true} is VALID [2022-04-15 06:43:14,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9627#true} {9627#true} #94#return; {9627#true} is VALID [2022-04-15 06:43:14,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {9627#true} assume true; {9627#true} is VALID [2022-04-15 06:43:14,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {9627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9627#true} is VALID [2022-04-15 06:43:14,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {9627#true} call ULTIMATE.init(); {9627#true} is VALID [2022-04-15 06:43:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:14,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774669273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:14,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:14,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 17 [2022-04-15 06:43:14,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:14,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1555554987] [2022-04-15 06:43:14,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1555554987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:14,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:14,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:43:14,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101670780] [2022-04-15 06:43:14,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:14,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:43:14,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:14,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,696 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:43:14,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:43:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:14,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:43:14,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:43:14,697 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:16,030 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2022-04-15 06:43:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:43:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:43:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 96 transitions. [2022-04-15 06:43:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 96 transitions. [2022-04-15 06:43:16,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 96 transitions. [2022-04-15 06:43:16,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:16,156 INFO L225 Difference]: With dead ends: 125 [2022-04-15 06:43:16,156 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 06:43:16,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:43:16,157 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:16,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 39 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:43:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 06:43:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 76. [2022-04-15 06:43:16,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:16,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,599 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,599 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:16,601 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2022-04-15 06:43:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2022-04-15 06:43:16,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:16,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:16,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-15 06:43:16,602 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-15 06:43:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:16,603 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2022-04-15 06:43:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2022-04-15 06:43:16,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:16,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:16,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:16,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2022-04-15 06:43:16,605 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 28 [2022-04-15 06:43:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:16,605 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-04-15 06:43:16,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:16,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 101 transitions. [2022-04-15 06:43:22,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 99 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2022-04-15 06:43:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:43:22,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:22,172 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:22,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:43:22,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:22,373 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:22,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1753627142, now seen corresponding path program 4 times [2022-04-15 06:43:22,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:22,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018922055] [2022-04-15 06:43:23,952 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:43:24,034 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:43:24,036 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1129797528, now seen corresponding path program 1 times [2022-04-15 06:43:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:24,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442146431] [2022-04-15 06:43:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:24,047 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:24,088 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:24,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {10506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-15 06:43:24,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-15 06:43:24,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-15 06:43:24,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {10494#true} call ULTIMATE.init(); {10506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:24,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {10506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-15 06:43:24,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-15 06:43:24,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-15 06:43:24,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {10494#true} call #t~ret17 := main(); {10494#true} is VALID [2022-04-15 06:43:24,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {10494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10494#true} is VALID [2022-04-15 06:43:24,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {10494#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse1 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse2 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_217 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_242 v_it_21 1) v_main_~y~0_241)))) (< 0 .cse4) (= v_main_~x~0_216 (+ v_main_~x~0_217 v_main_~y~0_242 (* (- 1) v_main_~y~0_241))) (< v_main_~y~0_242 v_main_~y~0_241)))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10494#true} is VALID [2022-04-15 06:43:24,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {10494#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10494#true} is VALID [2022-04-15 06:43:24,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {10494#true} ~z~0 := ~y~0; {10499#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:24,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {10499#(= 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; {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:24,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10501#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)))} is VALID [2022-04-15 06:43:24,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {10501#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:43:24,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:43:24,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {10502#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10503#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:43:24,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {10503#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10504#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:24,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {10504#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:24,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:24,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:24,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:24,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:24,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:24,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {10505#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-15 06:43:24,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {10495#false} assume !(~y~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-15 06:43:24,236 INFO L272 TraceCheckUtils]: 23: Hoare triple {10495#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10495#false} is VALID [2022-04-15 06:43:24,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {10495#false} ~cond := #in~cond; {10495#false} is VALID [2022-04-15 06:43:24,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {10495#false} assume 0 == ~cond; {10495#false} is VALID [2022-04-15 06:43:24,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {10495#false} assume !false; {10495#false} is VALID [2022-04-15 06:43:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:43:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:24,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442146431] [2022-04-15 06:43:24,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442146431] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:24,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434500961] [2022-04-15 06:43:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:24,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:24,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:24,238 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:43:24,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 06:43:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:24,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:43:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:24,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:24,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {10494#true} call ULTIMATE.init(); {10494#true} is VALID [2022-04-15 06:43:24,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {10494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-15 06:43:24,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-15 06:43:24,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-15 06:43:24,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {10494#true} call #t~ret17 := main(); {10494#true} is VALID [2022-04-15 06:43:24,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {10494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10494#true} is VALID [2022-04-15 06:43:24,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {10494#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse1 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse2 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_217 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_242 v_it_21 1) v_main_~y~0_241)))) (< 0 .cse4) (= v_main_~x~0_216 (+ v_main_~x~0_217 v_main_~y~0_242 (* (- 1) v_main_~y~0_241))) (< v_main_~y~0_242 v_main_~y~0_241)))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10494#true} is VALID [2022-04-15 06:43:24,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {10494#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10494#true} is VALID [2022-04-15 06:43:24,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {10494#true} ~z~0 := ~y~0; {10499#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:24,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {10499#(= 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; {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:24,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {10500#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:24,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {10540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10544#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:24,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {10544#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10544#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:24,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {10544#(= (+ main_~z~0 2) (+ (- 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; {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:24,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:24,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-15 06:43:24,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {10495#false} assume !(~y~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-15 06:43:24,452 INFO L272 TraceCheckUtils]: 23: Hoare triple {10495#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10495#false} is VALID [2022-04-15 06:43:24,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {10495#false} ~cond := #in~cond; {10495#false} is VALID [2022-04-15 06:43:24,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {10495#false} assume 0 == ~cond; {10495#false} is VALID [2022-04-15 06:43:24,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {10495#false} assume !false; {10495#false} is VALID [2022-04-15 06:43:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:43:24,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:24,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {10495#false} assume !false; {10495#false} is VALID [2022-04-15 06:43:24,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {10495#false} assume 0 == ~cond; {10495#false} is VALID [2022-04-15 06:43:24,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {10495#false} ~cond := #in~cond; {10495#false} is VALID [2022-04-15 06:43:24,661 INFO L272 TraceCheckUtils]: 23: Hoare triple {10495#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10495#false} is VALID [2022-04-15 06:43:24,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {10495#false} assume !(~y~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-15 06:43:24,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10495#false} is VALID [2022-04-15 06:43:24,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {10559#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:24,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10555#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:24,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10551#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:24,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:43:24,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {10639#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~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; {10632#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:43:24,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {10643#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~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; {10639#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:43:24,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {10647#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~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; {10643#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:43:24,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {10494#true} ~z~0 := ~y~0; {10647#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:43:24,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {10494#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10494#true} is VALID [2022-04-15 06:43:24,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {10494#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse1 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse2 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_217 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_242 v_it_21 1) v_main_~y~0_241)))) (< 0 .cse4) (= v_main_~x~0_216 (+ v_main_~x~0_217 v_main_~y~0_242 (* (- 1) v_main_~y~0_241))) (< v_main_~y~0_242 v_main_~y~0_241)))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10494#true} is VALID [2022-04-15 06:43:24,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {10494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10494#true} is VALID [2022-04-15 06:43:24,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {10494#true} call #t~ret17 := main(); {10494#true} is VALID [2022-04-15 06:43:24,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10494#true} {10494#true} #94#return; {10494#true} is VALID [2022-04-15 06:43:24,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {10494#true} assume true; {10494#true} is VALID [2022-04-15 06:43:24,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {10494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10494#true} is VALID [2022-04-15 06:43:24,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {10494#true} call ULTIMATE.init(); {10494#true} is VALID [2022-04-15 06:43:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:43:24,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434500961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:24,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:24,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:43:24,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:24,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018922055] [2022-04-15 06:43:24,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018922055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:24,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:24,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:43:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82971511] [2022-04-15 06:43:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:24,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:43:24,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:24,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:24,757 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:43:24,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:43:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:43:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:43:24,757 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:27,618 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2022-04-15 06:43:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:43:27,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:43:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 93 transitions. [2022-04-15 06:43:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 93 transitions. [2022-04-15 06:43:27,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 93 transitions. [2022-04-15 06:43:27,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:27,806 INFO L225 Difference]: With dead ends: 135 [2022-04-15 06:43:27,806 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 06:43:27,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:43:27,807 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:27,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:43:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 06:43:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2022-04-15 06:43:28,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:28,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have 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:43:28,335 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have 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:43:28,335 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have 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:43:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:28,336 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-04-15 06:43:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-04-15 06:43:28,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:28,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:28,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 06:43:28,337 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 06:43:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:28,338 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-04-15 06:43:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-04-15 06:43:28,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:28,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:28,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:28,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have 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:43:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2022-04-15 06:43:28,340 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 28 [2022-04-15 06:43:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:28,340 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2022-04-15 06:43:28,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:28,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 124 transitions. [2022-04-15 06:43:34,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 122 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2022-04-15 06:43:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:43:34,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:34,765 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:34,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 06:43:34,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 06:43:34,965 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 3 times [2022-04-15 06:43:34,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:34,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432257113] [2022-04-15 06:43:35,138 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:43:35,139 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1905988201, now seen corresponding path program 1 times [2022-04-15 06:43:35,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:35,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866689239] [2022-04-15 06:43:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:35,150 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:35,169 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:35,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:35,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {11449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11433#true} is VALID [2022-04-15 06:43:35,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {11433#true} assume true; {11433#true} is VALID [2022-04-15 06:43:35,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11433#true} {11433#true} #94#return; {11433#true} is VALID [2022-04-15 06:43:35,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {11433#true} call ULTIMATE.init(); {11449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:35,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {11449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11433#true} is VALID [2022-04-15 06:43:35,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {11433#true} assume true; {11433#true} is VALID [2022-04-15 06:43:35,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11433#true} {11433#true} #94#return; {11433#true} is VALID [2022-04-15 06:43:35,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {11433#true} call #t~ret17 := main(); {11433#true} is VALID [2022-04-15 06:43:35,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {11433#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11438#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:43:35,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {11438#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_231 4294967296)) (.cse1 (= v_main_~x~0_231 v_main_~x~0_230)) (.cse2 (= v_main_~y~0_257 v_main_~y~0_256)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_257 v_it_22 1) v_main_~y~0_256)) (< 0 (mod (+ v_main_~x~0_231 (* 4294967295 v_it_22)) 4294967296)) (not (<= 1 v_it_22)))) (< 0 .cse0) (= v_main_~x~0_230 (+ v_main_~x~0_231 (* (- 1) v_main_~y~0_256) v_main_~y~0_257)) (< v_main_~y~0_257 v_main_~y~0_256)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_257, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_256, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_230, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11439#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (div (+ main_~y~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 06:43:35,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {11439#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (div (+ main_~y~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11440#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ (* (div (+ main_~y~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 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:43:35,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {11440#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ (* (div (+ main_~y~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 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; {11441#(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:43:35,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {11441#(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; {11442#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:43:35,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {11442#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:43:35,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:43:35,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} is VALID [2022-04-15 06:43:35,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-15 06:43:35,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-15 06:43:35,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-15 06:43:35,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-15 06:43:35,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} is VALID [2022-04-15 06:43:35,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {11445#(and (<= (+ 2 (* (div (+ main_~z~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~z~0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} is VALID [2022-04-15 06:43:35,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:43:35,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:43:35,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {11443#(and (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 2) main_~n~0) (<= (* (div (+ main_~z~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} is VALID [2022-04-15 06:43:35,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {11444#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (+ (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~z~0;~z~0 := 1 + #t~post16;havoc #t~post16; {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:43:35,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:43:35,573 INFO L272 TraceCheckUtils]: 24: Hoare triple {11446#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11447#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:43:35,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {11447#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11448#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:43:35,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {11448#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11434#false} is VALID [2022-04-15 06:43:35,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {11434#false} assume !false; {11434#false} is VALID [2022-04-15 06:43:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:43:35,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:35,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866689239] [2022-04-15 06:43:35,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866689239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:35,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509832523] [2022-04-15 06:43:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:35,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:35,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:35,575 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:43:35,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 06:43:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:35,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 06:43:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,076 INFO L286 TraceCheckSpWp]: Computing forward predicates...