/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:49:10,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:49:10,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:49:10,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:49:10,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:49:10,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:49:10,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:49:10,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:49:10,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:49:10,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:49:10,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:49:10,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:49:10,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:49:10,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:49:10,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:49:10,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:49:10,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:49:10,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:49:10,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:49:10,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:49:10,511 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:49:10,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:49:10,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:49:10,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:49:10,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:49:10,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:49:10,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:49:10,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:49:10,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:49:10,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:49:10,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:49:10,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:49:10,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:49:10,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:49:10,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:49:10,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:49:10,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:49:10,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:49:10,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:49:10,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:49:10,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:49:10,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:49:10,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:49:10,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:49:10,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:49:10,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:49:10,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:49:10,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:49:10,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:49:10,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:49:10,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:49:10,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:49:10,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:49:10,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:49:10,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:49:10,531 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:49:10,531 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:49:10,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:49:10,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:49:10,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:49:10,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:49:10,732 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:49:10,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-15 12:49:10,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5992a36d2/cc4d4ee42bfb42829b347ae972173222/FLAG21ce75cfd [2022-04-15 12:49:11,103 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:49:11,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-15 12:49:11,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5992a36d2/cc4d4ee42bfb42829b347ae972173222/FLAG21ce75cfd [2022-04-15 12:49:11,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5992a36d2/cc4d4ee42bfb42829b347ae972173222 [2022-04-15 12:49:11,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:49:11,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:49:11,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:49:11,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:49:11,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:49:11,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c93907a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11, skipping insertion in model container [2022-04-15 12:49:11,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:49:11,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:49:11,253 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-de41.c[368,381] [2022-04-15 12:49:11,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:49:11,274 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:49:11,282 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-de41.c[368,381] [2022-04-15 12:49:11,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:49:11,292 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:49:11,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11 WrapperNode [2022-04-15 12:49:11,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:49:11,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:49:11,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:49:11,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:49:11,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:49:11,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:49:11,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:49:11,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:49:11,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (1/1) ... [2022-04-15 12:49:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:49:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:11,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:49:11,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:49:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:49:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:49:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:49:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:49:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:49:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:49:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:49:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:49:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:49:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:49:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:49:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:49:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:49:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:49:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:49:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:49:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:49:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:49:11,459 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:49:11,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:49:11,608 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:49:11,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:49:11,613 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 12:49:11,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:49:11 BoogieIcfgContainer [2022-04-15 12:49:11,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:49:11,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:49:11,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:49:11,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:49:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:49:11" (1/3) ... [2022-04-15 12:49:11,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7386a2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:49:11, skipping insertion in model container [2022-04-15 12:49:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:11" (2/3) ... [2022-04-15 12:49:11,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7386a2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:49:11, skipping insertion in model container [2022-04-15 12:49:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:49:11" (3/3) ... [2022-04-15 12:49:11,619 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.c [2022-04-15 12:49:11,622 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:49:11,622 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:49:11,649 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:49:11,653 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:49:11,653 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:49:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:49:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:49:11,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:11,668 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:11,669 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-15 12:49:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:11,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493043420] [2022-04-15 12:49:11,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:49:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-15 12:49:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:11,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347992069] [2022-04-15 12:49:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:11,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 12:49:11,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:49:11,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-15 12:49:11,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:11,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 12:49:11,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:49:11,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-15 12:49:11,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-15 12:49:11,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-15 12:49:11,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 12:49:11,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-15 12:49:11,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 12:49:11,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 12:49:11,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 12:49:11,806 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-15 12:49:11,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 12:49:11,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 12:49:11,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 12:49:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:11,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347992069] [2022-04-15 12:49:11,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347992069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:11,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:11,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:49:11,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493043420] [2022-04-15 12:49:11,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493043420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:11,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:11,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:49:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636617539] [2022-04-15 12:49:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:11,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:49:11,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:11,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:11,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:11,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:49:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:49:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:49:11,859 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:11,955 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 12:49:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:49:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:49:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 12:49:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 12:49:11,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-15 12:49:12,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:12,045 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:49:12,046 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:49:12,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:49:12,053 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:12,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:49:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:49:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:49:12,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:12,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,084 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,084 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:12,088 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-15 12:49:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 12:49:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:12,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:12,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:49:12,090 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:49:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:12,092 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-15 12:49:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 12:49:12,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:12,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:12,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:12,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-15 12:49:12,096 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-15 12:49:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:12,096 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-15 12:49:12,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-15 12:49:12,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 12:49:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:49:12,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:12,124 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:12,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:49:12,125 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-15 12:49:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:12,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124621194] [2022-04-15 12:49:12,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:49:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-15 12:49:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784763373] [2022-04-15 12:49:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:12,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:12,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-15 12:49:12,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-15 12:49:12,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-15 12:49:12,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:12,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-15 12:49:12,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-15 12:49:12,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-15 12:49:12,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-15 12:49:12,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:12,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:12,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:12,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~z~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:12,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:12,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} is VALID [2022-04-15 12:49:12,491 INFO L272 TraceCheckUtils]: 11: Hoare triple {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:12,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {185#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:12,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {185#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-15 12:49:12,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-15 12:49:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:12,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784763373] [2022-04-15 12:49:12,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784763373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:12,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:12,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:12,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:12,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124621194] [2022-04-15 12:49:12,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124621194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:12,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:12,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:12,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382117802] [2022-04-15 12:49:12,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:12,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:49:12,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:12,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:12,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:49:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:12,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:49:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:49:12,509 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:12,771 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 12:49:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:49:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:49:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 12:49:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 12:49:12,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-15 12:49:12,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:12,815 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:49:12,815 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:49:12,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:49:12,817 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:12,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:49:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:49:12,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:12,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,833 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,833 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:12,834 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:49:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:49:12,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:12,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:12,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:49:12,835 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:49:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:12,836 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:49:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:49:12,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:12,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:12,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:12,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 12:49:12,838 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-15 12:49:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:12,838 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 12:49:12,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:12,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 12:49:12,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:49:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:49:12,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:12,862 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:12,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:49:12,862 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-15 12:49:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:12,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087913376] [2022-04-15 12:49:15,542 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1649432706, now seen corresponding path program 1 times [2022-04-15 12:49:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:15,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306273385] [2022-04-15 12:49:15,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:16,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-15 12:49:16,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-15 12:49:16,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-15 12:49:16,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:16,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-15 12:49:16,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-15 12:49:16,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-15 12:49:16,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-15 12:49:16,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:49:16,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [76] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_1 v_main_~y~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (= 0 |v_main_#t~post6_Out_2|) (< 0 (mod (+ v_main_~x~0_Out_2 1) 4294967296)) (= |v_main_#t~post5_Out_2| 0) (= (+ v_main_~x~0_In_1 v_main_~y~0_In_1) (+ v_main_~x~0_Out_2 v_main_~y~0_Out_2)) (<= v_main_~x~0_Out_2 v_main_~x~0_In_1))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_~y~0=v_main_~y~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~x~0=v_main_~x~0_Out_2, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {363#(or (and (or (not (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (<= (+ (div main_~y~0 4294967296) (div (+ main_~x~0 1) 4294967296)) (div main_~n~0 4294967296))) (not (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))) (not (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-15 12:49:16,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(or (and (or (not (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (<= (+ (div main_~y~0 4294967296) (div (+ main_~x~0 1) 4294967296)) (div main_~n~0 4294967296))) (not (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296))) (not (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [75] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {364#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:16,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {364#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:16,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {364#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:16,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#(and (or (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {365#(and (<= (+ (div main_~y~0 4294967296) (div (+ main_~x~0 1) 4294967296)) (div main_~n~0 4294967296)) (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 12:49:16,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#(and (<= (+ (div main_~y~0 4294967296) (div (+ main_~x~0 1) 4294967296)) (div main_~n~0 4294967296)) (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div (+ main_~x~0 1) 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {366#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 12:49:16,019 INFO L272 TraceCheckUtils]: 12: Hoare triple {366#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {367#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:16,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {367#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {368#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:16,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {358#false} is VALID [2022-04-15 12:49:16,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-15 12:49:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:16,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306273385] [2022-04-15 12:49:16,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306273385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:16,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:16,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:49:16,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:16,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087913376] [2022-04-15 12:49:16,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087913376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:16,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:16,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:49:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428132261] [2022-04-15 12:49:16,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:49:16,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:16,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:16,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:49:16,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:49:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:49:16,146 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:16,760 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-15 12:49:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:49:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:49:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 12:49:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 12:49:16,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-15 12:49:16,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:16,820 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:49:16,820 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:49:16,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:49:16,822 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:16,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 48 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:49:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:49:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2022-04-15 12:49:16,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:16,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,849 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,849 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:16,851 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 12:49:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 12:49:16,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:16,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:16,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:49:16,851 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:49:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:16,852 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 12:49:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 12:49:16,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:16,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:16,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:16,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 12:49:16,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2022-04-15 12:49:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:16,854 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 12:49:16,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:16,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-15 12:49:16,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 12:49:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:49:16,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:16,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:16,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:49:16,910 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:16,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-15 12:49:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:16,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [694768912] [2022-04-15 12:49:17,096 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2129640343, now seen corresponding path program 1 times [2022-04-15 12:49:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:17,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182080224] [2022-04-15 12:49:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:17,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {592#true} is VALID [2022-04-15 12:49:17,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-15 12:49:17,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {592#true} {592#true} #72#return; {592#true} is VALID [2022-04-15 12:49:17,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:17,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {592#true} is VALID [2022-04-15 12:49:17,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2022-04-15 12:49:17,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #72#return; {592#true} is VALID [2022-04-15 12:49:17,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret13 := main(); {592#true} is VALID [2022-04-15 12:49:17,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {597#(= main_~y~0 0)} is VALID [2022-04-15 12:49:17,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {598#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:17,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {599#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:17,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [78] L23-2-->L29-1_primed: Formula: (or (and (= |v_main_#t~post8_Out_2| 0) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (<= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= (+ v_main_~x~0_Out_4 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_2)) (= |v_main_#t~post7_Out_2| 0)) (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_2 v_main_~x~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_2, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_4, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {600#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:17,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {600#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [77] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {601#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:17,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {601#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {601#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:17,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= 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; {593#false} is VALID [2022-04-15 12:49:17,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {593#false} assume !(~x~0 % 4294967296 > 0); {593#false} is VALID [2022-04-15 12:49:17,207 INFO L272 TraceCheckUtils]: 13: Hoare triple {593#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {593#false} is VALID [2022-04-15 12:49:17,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {593#false} ~cond := #in~cond; {593#false} is VALID [2022-04-15 12:49:17,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#false} assume 0 == ~cond; {593#false} is VALID [2022-04-15 12:49:17,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {593#false} assume !false; {593#false} is VALID [2022-04-15 12:49:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:17,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:17,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182080224] [2022-04-15 12:49:17,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182080224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:17,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:17,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:17,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:17,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [694768912] [2022-04-15 12:49:17,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [694768912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:17,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:17,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827750096] [2022-04-15 12:49:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:49:17,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:17,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:17,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:49:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:17,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:49:17,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:49:17,460 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:17,637 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-15 12:49:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:49:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:49:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 12:49:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 12:49:17,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-15 12:49:17,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:17,676 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:49:17,676 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:49:17,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:49:17,677 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:17,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-04-15 12:49:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:49:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 12:49:17,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:17,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,722 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,722 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:17,723 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 12:49:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 12:49:17,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:17,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:17,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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 28 states. [2022-04-15 12:49:17,724 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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 28 states. [2022-04-15 12:49:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:17,725 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 12:49:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 12:49:17,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:17,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:17,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:17,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-04-15 12:49:17,726 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2022-04-15 12:49:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:17,726 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-04-15 12:49:17,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:17,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 36 transitions. [2022-04-15 12:49:17,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 12:49:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:49:17,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:17,770 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:17,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:49:17,770 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1952840614, now seen corresponding path program 1 times [2022-04-15 12:49:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:17,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583911668] [2022-04-15 12:49:17,905 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1646204965, now seen corresponding path program 1 times [2022-04-15 12:49:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:17,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998970687] [2022-04-15 12:49:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:17,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:18,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {799#true} is VALID [2022-04-15 12:49:18,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-15 12:49:18,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {799#true} {799#true} #72#return; {799#true} is VALID [2022-04-15 12:49:18,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:18,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {799#true} is VALID [2022-04-15 12:49:18,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-15 12:49:18,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #72#return; {799#true} is VALID [2022-04-15 12:49:18,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2022-04-15 12:49:18,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {799#true} is VALID [2022-04-15 12:49:18,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {799#true} [80] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_Out_6 v_main_~y~0_Out_4) (+ v_main_~x~0_In_3 v_main_~y~0_In_2)) (= |v_main_#t~post5_Out_4| 0) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= 0 |v_main_#t~post6_Out_4|) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296))) (and (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {799#true} is VALID [2022-04-15 12:49:18,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {799#true} [79] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {799#true} is VALID [2022-04-15 12:49:18,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {799#true} ~z~0 := ~y~0; {804#(and (<= main_~y~0 main_~z~0) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)))} is VALID [2022-04-15 12:49:18,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {804#(and (<= main_~y~0 main_~z~0) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {805#(and (<= main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)))} is VALID [2022-04-15 12:49:18,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#(and (<= main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2022-04-15 12:49:18,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {800#false} assume !(~y~0 % 4294967296 > 0); {800#false} is VALID [2022-04-15 12:49:18,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#false} assume !(~x~0 % 4294967296 > 0); {800#false} is VALID [2022-04-15 12:49:18,010 INFO L272 TraceCheckUtils]: 13: Hoare triple {800#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {800#false} is VALID [2022-04-15 12:49:18,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {800#false} ~cond := #in~cond; {800#false} is VALID [2022-04-15 12:49:18,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {800#false} assume 0 == ~cond; {800#false} is VALID [2022-04-15 12:49:18,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#false} assume !false; {800#false} is VALID [2022-04-15 12:49:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:18,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:18,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998970687] [2022-04-15 12:49:18,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998970687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:18,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:18,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:49:18,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:18,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583911668] [2022-04-15 12:49:18,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583911668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:18,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:18,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:49:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727804024] [2022-04-15 12:49:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:49:18,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:18,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:18,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:49:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:18,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:49:18,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:49:18,053 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:18,245 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 12:49:18,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:49:18,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:49:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 12:49:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 12:49:18,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-15 12:49:18,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:18,277 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:49:18,277 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:49:18,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:49:18,278 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:18,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:49:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:49:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 12:49:18,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:18,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,315 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,315 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:18,316 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-15 12:49:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-15 12:49:18,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:18,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:18,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 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 26 states. [2022-04-15 12:49:18,316 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 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 26 states. [2022-04-15 12:49:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:18,317 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-15 12:49:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-15 12:49:18,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:18,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:18,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:18,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-04-15 12:49:18,318 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 17 [2022-04-15 12:49:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:18,319 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-04-15 12:49:18,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:18,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 31 transitions. [2022-04-15 12:49:18,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 12:49:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:49:18,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:18,397 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:18,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:49:18,397 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash 17779232, now seen corresponding path program 2 times [2022-04-15 12:49:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:18,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1395926598] [2022-04-15 12:49:18,561 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1871063831, now seen corresponding path program 1 times [2022-04-15 12:49:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:18,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770471938] [2022-04-15 12:49:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:18,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {987#true} is VALID [2022-04-15 12:49:18,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {987#true} assume true; {987#true} is VALID [2022-04-15 12:49:18,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {987#true} {987#true} #72#return; {987#true} is VALID [2022-04-15 12:49:18,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {987#true} call ULTIMATE.init(); {997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:18,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {987#true} is VALID [2022-04-15 12:49:18,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {987#true} assume true; {987#true} is VALID [2022-04-15 12:49:18,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {987#true} {987#true} #72#return; {987#true} is VALID [2022-04-15 12:49:18,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {987#true} call #t~ret13 := main(); {987#true} is VALID [2022-04-15 12:49:18,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {987#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {992#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:49:18,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {992#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {993#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:18,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {993#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {994#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:18,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {994#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [82] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~z~0_In_2 v_main_~z~0_Out_4)) (and (< 0 (mod (+ v_main_~z~0_Out_4 1) 4294967296)) (= |v_main_#t~post7_Out_4| 0) (= (+ v_main_~x~0_Out_8 v_main_~z~0_Out_4) (+ v_main_~z~0_In_2 v_main_~x~0_In_4)) (= |v_main_#t~post8_Out_4| 0) (<= v_main_~x~0_In_4 v_main_~x~0_Out_8))) InVars {main_~x~0=v_main_~x~0_In_4, main_~z~0=v_main_~z~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_8, main_#t~post8=|v_main_#t~post8_Out_4|, main_~z~0=v_main_~z~0_Out_4, main_#t~post7=|v_main_#t~post7_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {995#(and (or (not (= 0 (+ main_~x~0 (* (- 1) main_~n~0)))) (<= main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-15 12:49:18,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {995#(and (or (not (= 0 (+ main_~x~0 (* (- 1) main_~n~0)))) (<= main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))))} [81] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {996#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:18,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {996#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {996#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:18,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {996#(<= 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; {988#false} is VALID [2022-04-15 12:49:18,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {988#false} assume !(~x~0 % 4294967296 > 0); {988#false} is VALID [2022-04-15 12:49:18,721 INFO L272 TraceCheckUtils]: 13: Hoare triple {988#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {988#false} is VALID [2022-04-15 12:49:18,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#false} ~cond := #in~cond; {988#false} is VALID [2022-04-15 12:49:18,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {988#false} assume 0 == ~cond; {988#false} is VALID [2022-04-15 12:49:18,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#false} assume !false; {988#false} is VALID [2022-04-15 12:49:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:18,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:18,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770471938] [2022-04-15 12:49:18,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770471938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:18,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:18,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:18,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1395926598] [2022-04-15 12:49:18,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1395926598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:18,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:18,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:49:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604356987] [2022-04-15 12:49:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) 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 12:49:18,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:18,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) 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 12:49:18,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:18,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:49:18,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:18,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:49:18,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:49:18,951 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) 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 12:49:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:19,222 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 12:49:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:49:19,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) 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 12:49:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) 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 12:49:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:49:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) 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 12:49:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:49:19,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-15 12:49:19,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:19,267 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:49:19,268 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:49:19,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:49:19,268 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:19,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:49:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 12:49:19,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:19,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:19,289 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:19,289 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:19,290 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 12:49:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 12:49:19,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:19,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:19,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:49:19,293 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:49:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:19,293 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 12:49:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 12:49:19,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:19,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:19,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:19,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 12:49:19,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 18 [2022-04-15 12:49:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:19,297 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 12:49:19,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) 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 12:49:19,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 12:49:19,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 12:49:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:49:19,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:19,328 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:19,328 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:49:19,328 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -58627519, now seen corresponding path program 1 times [2022-04-15 12:49:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:19,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523132087] [2022-04-15 12:49:19,465 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:19,466 INFO L85 PathProgramCache]: Analyzing trace with hash 944061986, now seen corresponding path program 1 times [2022-04-15 12:49:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:19,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772173990] [2022-04-15 12:49:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:19,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:19,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {1163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1155#true} is VALID [2022-04-15 12:49:19,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-15 12:49:19,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1155#true} {1155#true} #72#return; {1155#true} is VALID [2022-04-15 12:49:19,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:19,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1155#true} is VALID [2022-04-15 12:49:19,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-15 12:49:19,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #72#return; {1155#true} is VALID [2022-04-15 12:49:19,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret13 := main(); {1155#true} is VALID [2022-04-15 12:49:19,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1155#true} is VALID [2022-04-15 12:49:19,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {1155#true} [84] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1155#true} is VALID [2022-04-15 12:49:19,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {1155#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-15 12:49:19,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {1155#true} ~z~0 := ~y~0; {1160#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:49:19,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(= (+ 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; {1161#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:19,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:19,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1156#false} is VALID [2022-04-15 12:49:19,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {1156#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; {1156#false} is VALID [2022-04-15 12:49:19,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#false} assume !(~x~0 % 4294967296 > 0); {1156#false} is VALID [2022-04-15 12:49:19,554 INFO L272 TraceCheckUtils]: 14: Hoare triple {1156#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1156#false} is VALID [2022-04-15 12:49:19,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-15 12:49:19,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-15 12:49:19,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-15 12:49:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:19,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772173990] [2022-04-15 12:49:19,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772173990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:19,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013736904] [2022-04-15 12:49:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:19,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:19,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:19,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:19,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:49:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:19,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:49:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:19,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:19,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-15 12:49:19,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1155#true} is VALID [2022-04-15 12:49:19,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-15 12:49:19,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #72#return; {1155#true} is VALID [2022-04-15 12:49:19,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret13 := main(); {1155#true} is VALID [2022-04-15 12:49:19,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1155#true} is VALID [2022-04-15 12:49:19,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {1155#true} [84] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1155#true} is VALID [2022-04-15 12:49:19,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {1155#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-15 12:49:19,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {1155#true} ~z~0 := ~y~0; {1160#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:49:19,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(= (+ 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; {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:19,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:19,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1156#false} is VALID [2022-04-15 12:49:19,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {1156#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; {1156#false} is VALID [2022-04-15 12:49:19,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#false} assume !(~x~0 % 4294967296 > 0); {1156#false} is VALID [2022-04-15 12:49:19,865 INFO L272 TraceCheckUtils]: 14: Hoare triple {1156#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1156#false} is VALID [2022-04-15 12:49:19,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-15 12:49:19,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-15 12:49:19,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-15 12:49:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:19,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:20,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-15 12:49:20,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-15 12:49:20,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-15 12:49:20,087 INFO L272 TraceCheckUtils]: 14: Hoare triple {1156#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1156#false} is VALID [2022-04-15 12:49:20,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#false} assume !(~x~0 % 4294967296 > 0); {1156#false} is VALID [2022-04-15 12:49:20,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {1156#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; {1156#false} is VALID [2022-04-15 12:49:20,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1156#false} is VALID [2022-04-15 12:49:20,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:20,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1242#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 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; {1162#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:20,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1155#true} ~z~0 := ~y~0; {1242#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:49:20,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1155#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-15 12:49:20,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {1155#true} [84] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1155#true} is VALID [2022-04-15 12:49:20,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1155#true} is VALID [2022-04-15 12:49:20,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret13 := main(); {1155#true} is VALID [2022-04-15 12:49:20,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #72#return; {1155#true} is VALID [2022-04-15 12:49:20,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-15 12:49:20,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1155#true} is VALID [2022-04-15 12:49:20,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-15 12:49:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:20,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013736904] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:20,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:49:20,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 7 [2022-04-15 12:49:20,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:20,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523132087] [2022-04-15 12:49:20,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523132087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:20,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:20,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:49:20,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540262475] [2022-04-15 12:49:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:20,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:49:20,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:20,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:20,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:49:20,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:49:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:49:20,131 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:20,226 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 12:49:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:49:20,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:49:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 12:49:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 12:49:20,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 12:49:20,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:20,250 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:49:20,250 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:49:20,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:49:20,251 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:20,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:49:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:49:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 12:49:20,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:20,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,268 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,268 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:20,269 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 12:49:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 12:49:20,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:20,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:20,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:49:20,270 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:49:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:20,270 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 12:49:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 12:49:20,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:20,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:20,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:20,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 12:49:20,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 18 [2022-04-15 12:49:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:20,271 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 12:49:20,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:20,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 12:49:20,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 12:49:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:49:20,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:20,298 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:20,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:20,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:20,499 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:20,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-15 12:49:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:20,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142617458] [2022-04-15 12:49:20,640 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -988846895, now seen corresponding path program 1 times [2022-04-15 12:49:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:20,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957073121] [2022-04-15 12:49:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:20,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {1416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-15 12:49:20,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-15 12:49:20,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #72#return; {1407#true} is VALID [2022-04-15 12:49:20,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:20,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-15 12:49:20,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-15 12:49:20,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #72#return; {1407#true} is VALID [2022-04-15 12:49:20,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret13 := main(); {1407#true} is VALID [2022-04-15 12:49:20,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1412#(= main_~y~0 0)} is VALID [2022-04-15 12:49:20,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {1412#(= main_~y~0 0)} [86] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1413#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:49:20,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {1413#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1413#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:49:20,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {1414#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:49:20,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1414#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1415#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:20,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {1415#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1415#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:20,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {1415#(<= (+ (* 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; {1415#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:20,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {1415#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1415#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:20,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {1415#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1408#false} is VALID [2022-04-15 12:49:20,764 INFO L272 TraceCheckUtils]: 14: Hoare triple {1408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1408#false} is VALID [2022-04-15 12:49:20,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {1408#false} ~cond := #in~cond; {1408#false} is VALID [2022-04-15 12:49:20,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {1408#false} assume 0 == ~cond; {1408#false} is VALID [2022-04-15 12:49:20,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-15 12:49:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:20,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:20,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957073121] [2022-04-15 12:49:20,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957073121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:20,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485487358] [2022-04-15 12:49:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:20,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:20,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:20,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:20,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:49:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:20,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:49:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:21,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2022-04-15 12:49:21,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-15 12:49:21,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-15 12:49:21,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #72#return; {1407#true} is VALID [2022-04-15 12:49:21,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret13 := main(); {1407#true} is VALID [2022-04-15 12:49:21,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1435#(= main_~n~0 main_~x~0)} is VALID [2022-04-15 12:49:21,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(= main_~n~0 main_~x~0)} [86] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1439#(or (= main_~n~0 main_~x~0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0)))} is VALID [2022-04-15 12:49:21,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {1439#(or (= main_~n~0 main_~x~0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0)))} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1443#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:21,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {1443#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {1443#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:21,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {1443#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1450#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:49:21,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {1450#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~z~0 % 4294967296 > 0); {1450#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:49:21,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {1450#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1450#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:49:21,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {1450#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~y~0 % 4294967296 > 0); {1460#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:49:21,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1460#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~x~0 % 4294967296 > 0); {1408#false} is VALID [2022-04-15 12:49:21,147 INFO L272 TraceCheckUtils]: 14: Hoare triple {1408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1408#false} is VALID [2022-04-15 12:49:21,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {1408#false} ~cond := #in~cond; {1408#false} is VALID [2022-04-15 12:49:21,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {1408#false} assume 0 == ~cond; {1408#false} is VALID [2022-04-15 12:49:21,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-15 12:49:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:21,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:21,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-04-15 12:49:21,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {1479#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1408#false} is VALID [2022-04-15 12:49:21,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {1483#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1479#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:21,585 INFO L272 TraceCheckUtils]: 14: Hoare triple {1487#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1483#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:49:21,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1491#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1487#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-15 12:49:21,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {1495#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1491#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:49:21,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {1495#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1495#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:21,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {1495#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1495#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:21,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1505#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~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; {1495#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:21,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1505#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {1505#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-15 12:49:21,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1407#true} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1505#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-15 12:49:21,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#true} [86] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1407#true} is VALID [2022-04-15 12:49:21,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1407#true} is VALID [2022-04-15 12:49:21,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#true} call #t~ret13 := main(); {1407#true} is VALID [2022-04-15 12:49:21,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#true} {1407#true} #72#return; {1407#true} is VALID [2022-04-15 12:49:21,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-04-15 12:49:21,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1407#true} is VALID [2022-04-15 12:49:21,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2022-04-15 12:49:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:21,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485487358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:21,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:21,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2022-04-15 12:49:21,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:21,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142617458] [2022-04-15 12:49:21,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142617458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:21,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:21,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845727153] [2022-04-15 12:49:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:21,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:49:21,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:21,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:21,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:21,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:49:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:49:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:49:21,681 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:21,993 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 12:49:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:49:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:49:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:49:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:49:21,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-15 12:49:22,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:22,027 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:49:22,027 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:49:22,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:49:22,028 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:22,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 40 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:49:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 12:49:22,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:22,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,062 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,062 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:22,062 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 12:49:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 12:49:22,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:22,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:22,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:49:22,063 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:49:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:22,064 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 12:49:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 12:49:22,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:22,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:22,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:22,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 12:49:22,065 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2022-04-15 12:49:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:22,065 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 12:49:22,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:22,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 12:49:22,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:22,102 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:49:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:49:22,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:22,103 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:22,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:22,303 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,SelfDestructingSolverStorable7 [2022-04-15 12:49:22,303 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-15 12:49:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:22,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349632430] [2022-04-15 12:49:22,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash -883628153, now seen corresponding path program 1 times [2022-04-15 12:49:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:22,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054932268] [2022-04-15 12:49:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:22,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:22,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {1710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1697#true} is VALID [2022-04-15 12:49:22,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {1697#true} assume true; {1697#true} is VALID [2022-04-15 12:49:22,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1697#true} {1697#true} #72#return; {1697#true} is VALID [2022-04-15 12:49:22,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:22,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1697#true} is VALID [2022-04-15 12:49:22,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2022-04-15 12:49:22,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #72#return; {1697#true} is VALID [2022-04-15 12:49:22,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret13 := main(); {1697#true} is VALID [2022-04-15 12:49:22,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1697#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1702#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:22,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {1702#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [88] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1703#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 12:49:22,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {1703#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1704#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:49:22,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1704#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {1705#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:49:22,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {1705#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~y~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-15 12:49:22,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-15 12:49:22,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 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; {1707#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} is VALID [2022-04-15 12:49:22,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {1707#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {1707#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} is VALID [2022-04-15 12:49:22,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {1707#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 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; {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-15 12:49:22,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-15 12:49:22,636 INFO L272 TraceCheckUtils]: 15: Hoare triple {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1708#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:22,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {1708#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1709#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:22,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {1709#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1698#false} is VALID [2022-04-15 12:49:22,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1698#false} assume !false; {1698#false} is VALID [2022-04-15 12:49:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:22,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:22,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054932268] [2022-04-15 12:49:22,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054932268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:22,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365143110] [2022-04-15 12:49:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:22,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:22,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:22,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:22,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:49:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:22,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:49:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:22,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:40,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1697#true} is VALID [2022-04-15 12:49:40,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {1697#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1697#true} is VALID [2022-04-15 12:49:40,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2022-04-15 12:49:40,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #72#return; {1697#true} is VALID [2022-04-15 12:49:40,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret13 := main(); {1697#true} is VALID [2022-04-15 12:49:40,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {1697#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1702#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:40,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {1702#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [88] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1732#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:49:40,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {1732#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1736#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:49:40,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {1736#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {1740#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:49:40,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {1740#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1744#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:49:40,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {1744#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1744#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:49:40,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {1744#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~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; {1751#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:49:40,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {1751#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~y~0 % 4294967296 > 0); {1751#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:49:40,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {1751#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295) 1) 4294967296)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1758#(and (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296)) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))} is VALID [2022-04-15 12:49:40,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {1758#(and (< 0 (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296)) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))} assume !(~x~0 % 4294967296 > 0); {1762#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:49:40,096 INFO L272 TraceCheckUtils]: 15: Hoare triple {1762#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1766#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:49:40,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {1766#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1770#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:49:40,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {1770#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1698#false} is VALID [2022-04-15 12:49:40,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {1698#false} assume !false; {1698#false} is VALID [2022-04-15 12:49:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:40,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:41,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {1698#false} assume !false; {1698#false} is VALID [2022-04-15 12:49:41,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {1770#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1698#false} is VALID [2022-04-15 12:49:41,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {1766#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1770#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:49:41,624 INFO L272 TraceCheckUtils]: 15: Hoare triple {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1766#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:49:41,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {1789#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1706#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-15 12:49:41,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {1793#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 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; {1789#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:41,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {1793#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {1793#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)))} is VALID [2022-04-15 12:49:41,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {1800#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 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; {1793#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)))} is VALID [2022-04-15 12:49:41,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {1800#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {1800#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-15 12:49:41,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1800#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-15 12:49:41,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {1811#(or (<= (mod main_~y~0 4294967296) 0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {1807#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:49:41,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {1811#(or (<= (mod main_~y~0 4294967296) 0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1811#(or (<= (mod main_~y~0 4294967296) 0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:41,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {1818#(or (<= (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 1)) (<= (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0 (- 4294967296)) 4294967296) 1)))} [88] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1811#(or (<= (mod main_~y~0 4294967296) 0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:41,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {1697#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1818#(or (<= (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (* (- 1) main_~x~0) (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 1)) (<= (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 main_~x~0 (- 4294967296)) 4294967296) 1)))} is VALID [2022-04-15 12:49:41,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret13 := main(); {1697#true} is VALID [2022-04-15 12:49:41,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #72#return; {1697#true} is VALID [2022-04-15 12:49:41,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2022-04-15 12:49:41,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {1697#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1697#true} is VALID [2022-04-15 12:49:41,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1697#true} is VALID [2022-04-15 12:49:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:41,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365143110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:41,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:41,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 26 [2022-04-15 12:49:41,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349632430] [2022-04-15 12:49:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349632430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:41,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:41,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:49:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271241657] [2022-04-15 12:49:41,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:41,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:49:41,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:41,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:41,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:41,773 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:49:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:41,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:49:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:49:41,776 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,496 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 12:49:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:49:42,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:49:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 12:49:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 12:49:42,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-15 12:49:42,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:42,543 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:49:42,543 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:49:42,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:49:42,544 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:42,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 54 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:49:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:49:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-15 12:49:42,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:42,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,607 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,607 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,608 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-15 12:49:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-15 12:49:42,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:42,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:42,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:49:42,608 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:49:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,609 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-15 12:49:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-15 12:49:42,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:42,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:42,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:42,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-04-15 12:49:42,610 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 19 [2022-04-15 12:49:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:42,610 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-04-15 12:49:42,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:42,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 35 transitions. [2022-04-15 12:49:42,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 12:49:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:49:42,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:42,664 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:42,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:42,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:42,865 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 2 times [2022-04-15 12:49:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:42,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2058552287] [2022-04-15 12:49:43,001 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -311079835, now seen corresponding path program 1 times [2022-04-15 12:49:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466064723] [2022-04-15 12:49:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {2046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2037#true} is VALID [2022-04-15 12:49:43,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {2037#true} assume true; {2037#true} is VALID [2022-04-15 12:49:43,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2037#true} {2037#true} #72#return; {2037#true} is VALID [2022-04-15 12:49:43,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {2037#true} call ULTIMATE.init(); {2046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:43,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {2046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2037#true} is VALID [2022-04-15 12:49:43,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {2037#true} assume true; {2037#true} is VALID [2022-04-15 12:49:43,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2037#true} {2037#true} #72#return; {2037#true} is VALID [2022-04-15 12:49:43,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {2037#true} call #t~ret13 := main(); {2037#true} is VALID [2022-04-15 12:49:43,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {2037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2037#true} is VALID [2022-04-15 12:49:43,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {2037#true} [90] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2037#true} is VALID [2022-04-15 12:49:43,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {2037#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-15 12:49:43,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {2037#true} ~z~0 := ~y~0; {2042#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:43,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {2042#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2043#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:43,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {2043#(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; {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:43,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:43,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {2044#(<= 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; {2045#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:43,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {2045#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2038#false} is VALID [2022-04-15 12:49:43,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {2038#false} assume !(~x~0 % 4294967296 > 0); {2038#false} is VALID [2022-04-15 12:49:43,077 INFO L272 TraceCheckUtils]: 15: Hoare triple {2038#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2038#false} is VALID [2022-04-15 12:49:43,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {2038#false} ~cond := #in~cond; {2038#false} is VALID [2022-04-15 12:49:43,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {2038#false} assume 0 == ~cond; {2038#false} is VALID [2022-04-15 12:49:43,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {2038#false} assume !false; {2038#false} is VALID [2022-04-15 12:49:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:43,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466064723] [2022-04-15 12:49:43,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466064723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:43,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525060778] [2022-04-15 12:49:43,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:43,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:43,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:49:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:49:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:43,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {2037#true} call ULTIMATE.init(); {2037#true} is VALID [2022-04-15 12:49:43,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2037#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2037#true} is VALID [2022-04-15 12:49:43,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {2037#true} assume true; {2037#true} is VALID [2022-04-15 12:49:43,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2037#true} {2037#true} #72#return; {2037#true} is VALID [2022-04-15 12:49:43,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {2037#true} call #t~ret13 := main(); {2037#true} is VALID [2022-04-15 12:49:43,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {2037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2037#true} is VALID [2022-04-15 12:49:43,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {2037#true} [90] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2037#true} is VALID [2022-04-15 12:49:43,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {2037#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-15 12:49:43,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {2037#true} ~z~0 := ~y~0; {2042#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:43,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {2042#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2043#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:43,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {2043#(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; {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:43,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:43,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {2044#(<= 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; {2045#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:43,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {2045#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2038#false} is VALID [2022-04-15 12:49:43,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {2038#false} assume !(~x~0 % 4294967296 > 0); {2038#false} is VALID [2022-04-15 12:49:43,465 INFO L272 TraceCheckUtils]: 15: Hoare triple {2038#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2038#false} is VALID [2022-04-15 12:49:43,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {2038#false} ~cond := #in~cond; {2038#false} is VALID [2022-04-15 12:49:43,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {2038#false} assume 0 == ~cond; {2038#false} is VALID [2022-04-15 12:49:43,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {2038#false} assume !false; {2038#false} is VALID [2022-04-15 12:49:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:43,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:43,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {2038#false} assume !false; {2038#false} is VALID [2022-04-15 12:49:43,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {2038#false} assume 0 == ~cond; {2038#false} is VALID [2022-04-15 12:49:43,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {2038#false} ~cond := #in~cond; {2038#false} is VALID [2022-04-15 12:49:43,669 INFO L272 TraceCheckUtils]: 15: Hoare triple {2038#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2038#false} is VALID [2022-04-15 12:49:43,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {2038#false} assume !(~x~0 % 4294967296 > 0); {2038#false} is VALID [2022-04-15 12:49:43,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {2045#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2038#false} is VALID [2022-04-15 12:49:43,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {2044#(<= 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; {2045#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:43,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:43,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {2128#(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; {2044#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:43,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#(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; {2128#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:49:43,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {2037#true} ~z~0 := ~y~0; {2132#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:43,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {2037#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2037#true} is VALID [2022-04-15 12:49:43,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {2037#true} [90] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2037#true} is VALID [2022-04-15 12:49:43,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {2037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2037#true} is VALID [2022-04-15 12:49:43,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {2037#true} call #t~ret13 := main(); {2037#true} is VALID [2022-04-15 12:49:43,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2037#true} {2037#true} #72#return; {2037#true} is VALID [2022-04-15 12:49:43,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {2037#true} assume true; {2037#true} is VALID [2022-04-15 12:49:43,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {2037#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2037#true} is VALID [2022-04-15 12:49:43,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {2037#true} call ULTIMATE.init(); {2037#true} is VALID [2022-04-15 12:49:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:43,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525060778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:43,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:43,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:49:43,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:43,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2058552287] [2022-04-15 12:49:43,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2058552287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:43,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:43,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:43,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230290264] [2022-04-15 12:49:43,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:43,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:49:43,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:43,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:43,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:43,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:49:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:43,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:49:43,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:49:43,739 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:44,094 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 12:49:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:49:44,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:49:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-15 12:49:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-15 12:49:44,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2022-04-15 12:49:44,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:44,128 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:49:44,128 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:49:44,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:49:44,130 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:44,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 43 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:49:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-15 12:49:44,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:44,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,196 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,196 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:44,198 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 12:49:44,198 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 12:49:44,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:44,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:44,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:49:44,198 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:49:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:44,199 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 12:49:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 12:49:44,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:44,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:44,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:44,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-15 12:49:44,200 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2022-04-15 12:49:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:44,200 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-15 12:49:44,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:44,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-15 12:49:44,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 12:49:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:49:44,258 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:44,258 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:44,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:44,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:44,459 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-04-15 12:49:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:44,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74501868] [2022-04-15 12:49:44,621 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash -489053103, now seen corresponding path program 1 times [2022-04-15 12:49:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:44,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815887170] [2022-04-15 12:49:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:44,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2363#true} is VALID [2022-04-15 12:49:44,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {2363#true} assume true; {2363#true} is VALID [2022-04-15 12:49:44,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2363#true} {2363#true} #72#return; {2363#true} is VALID [2022-04-15 12:49:44,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {2363#true} call ULTIMATE.init(); {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:44,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2363#true} is VALID [2022-04-15 12:49:44,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {2363#true} assume true; {2363#true} is VALID [2022-04-15 12:49:44,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2363#true} {2363#true} #72#return; {2363#true} is VALID [2022-04-15 12:49:44,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {2363#true} call #t~ret13 := main(); {2363#true} is VALID [2022-04-15 12:49:44,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {2363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2363#true} is VALID [2022-04-15 12:49:44,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {2363#true} [92] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2363#true} is VALID [2022-04-15 12:49:44,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {2363#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:44,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:44,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#(<= 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; {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {2369#(<= 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; {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {2369#(<= 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; {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:44,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {2368#(<= 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; {2364#false} is VALID [2022-04-15 12:49:44,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {2364#false} assume !(~x~0 % 4294967296 > 0); {2364#false} is VALID [2022-04-15 12:49:44,683 INFO L272 TraceCheckUtils]: 16: Hoare triple {2364#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2364#false} is VALID [2022-04-15 12:49:44,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {2364#false} ~cond := #in~cond; {2364#false} is VALID [2022-04-15 12:49:44,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {2364#false} assume 0 == ~cond; {2364#false} is VALID [2022-04-15 12:49:44,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#false} assume !false; {2364#false} is VALID [2022-04-15 12:49:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:44,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815887170] [2022-04-15 12:49:44,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815887170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174561597] [2022-04-15 12:49:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:44,700 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:44,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:49:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:44,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:49:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:44,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:44,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {2363#true} call ULTIMATE.init(); {2363#true} is VALID [2022-04-15 12:49:44,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {2363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2363#true} is VALID [2022-04-15 12:49:44,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {2363#true} assume true; {2363#true} is VALID [2022-04-15 12:49:44,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2363#true} {2363#true} #72#return; {2363#true} is VALID [2022-04-15 12:49:44,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {2363#true} call #t~ret13 := main(); {2363#true} is VALID [2022-04-15 12:49:44,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {2363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2363#true} is VALID [2022-04-15 12:49:44,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {2363#true} [92] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2363#true} is VALID [2022-04-15 12:49:44,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {2363#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:44,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:44,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#(<= 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; {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {2369#(<= 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; {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:44,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {2369#(<= 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; {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:44,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {2368#(<= 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; {2364#false} is VALID [2022-04-15 12:49:44,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {2364#false} assume !(~x~0 % 4294967296 > 0); {2364#false} is VALID [2022-04-15 12:49:44,934 INFO L272 TraceCheckUtils]: 16: Hoare triple {2364#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2364#false} is VALID [2022-04-15 12:49:44,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {2364#false} ~cond := #in~cond; {2364#false} is VALID [2022-04-15 12:49:44,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {2364#false} assume 0 == ~cond; {2364#false} is VALID [2022-04-15 12:49:44,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#false} assume !false; {2364#false} is VALID [2022-04-15 12:49:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:44,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:45,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#false} assume !false; {2364#false} is VALID [2022-04-15 12:49:45,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {2364#false} assume 0 == ~cond; {2364#false} is VALID [2022-04-15 12:49:45,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {2364#false} ~cond := #in~cond; {2364#false} is VALID [2022-04-15 12:49:45,106 INFO L272 TraceCheckUtils]: 16: Hoare triple {2364#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2364#false} is VALID [2022-04-15 12:49:45,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {2364#false} assume !(~x~0 % 4294967296 > 0); {2364#false} is VALID [2022-04-15 12:49:45,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {2368#(<= 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; {2364#false} is VALID [2022-04-15 12:49:45,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {2369#(<= 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; {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:45,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:45,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {2369#(<= 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; {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:45,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:45,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#(<= 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; {2369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:45,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:45,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {2363#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:45,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {2363#true} [92] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2363#true} is VALID [2022-04-15 12:49:45,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {2363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2363#true} is VALID [2022-04-15 12:49:45,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {2363#true} call #t~ret13 := main(); {2363#true} is VALID [2022-04-15 12:49:45,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2363#true} {2363#true} #72#return; {2363#true} is VALID [2022-04-15 12:49:45,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {2363#true} assume true; {2363#true} is VALID [2022-04-15 12:49:45,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {2363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2363#true} is VALID [2022-04-15 12:49:45,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {2363#true} call ULTIMATE.init(); {2363#true} is VALID [2022-04-15 12:49:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:45,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174561597] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:45,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:45,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 12:49:45,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:45,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74501868] [2022-04-15 12:49:45,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74501868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:45,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:45,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:49:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079218403] [2022-04-15 12:49:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:49:45,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:45,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:45,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:49:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:49:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:49:45,155 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:45,394 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 12:49:45,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:49:45,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:49:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 12:49:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 12:49:45,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 12:49:45,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:45,430 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:49:45,431 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:49:45,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 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 12:49:45,431 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:45,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 22 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:49:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:49:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-04-15 12:49:45,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:45,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,486 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,486 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:45,490 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 12:49:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 12:49:45,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:45,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:45,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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 31 states. [2022-04-15 12:49:45,491 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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 31 states. [2022-04-15 12:49:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:45,494 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 12:49:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 12:49:45,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:45,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:45,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:45,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 12:49:45,495 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2022-04-15 12:49:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:45,495 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 12:49:45,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:45,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 12:49:45,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 12:49:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:49:45,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:45,561 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:45,578 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 12:49:45,761 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,SelfDestructingSolverStorable10 [2022-04-15 12:49:45,762 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:45,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash 633740065, now seen corresponding path program 3 times [2022-04-15 12:49:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:45,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189228247] [2022-04-15 12:49:45,855 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1548968958, now seen corresponding path program 1 times [2022-04-15 12:49:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:45,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303540716] [2022-04-15 12:49:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:45,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {2698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2689#true} is VALID [2022-04-15 12:49:45,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {2689#true} assume true; {2689#true} is VALID [2022-04-15 12:49:45,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2689#true} {2689#true} #72#return; {2689#true} is VALID [2022-04-15 12:49:45,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {2689#true} call ULTIMATE.init(); {2698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:45,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2689#true} is VALID [2022-04-15 12:49:45,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {2689#true} assume true; {2689#true} is VALID [2022-04-15 12:49:45,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2689#true} {2689#true} #72#return; {2689#true} is VALID [2022-04-15 12:49:45,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {2689#true} call #t~ret13 := main(); {2689#true} is VALID [2022-04-15 12:49:45,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {2689#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2689#true} is VALID [2022-04-15 12:49:45,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {2689#true} [94] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2689#true} is VALID [2022-04-15 12:49:45,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {2689#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2689#true} is VALID [2022-04-15 12:49:45,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {2689#true} ~z~0 := ~y~0; {2694#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:49:45,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {2694#(= (+ 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; {2695#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:45,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {2695#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2696#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:49:45,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {2696#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2697#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:45,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#(<= 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; {2690#false} is VALID [2022-04-15 12:49:45,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {2690#false} assume !(~y~0 % 4294967296 > 0); {2690#false} is VALID [2022-04-15 12:49:45,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {2690#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; {2690#false} is VALID [2022-04-15 12:49:45,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {2690#false} assume !(~x~0 % 4294967296 > 0); {2690#false} is VALID [2022-04-15 12:49:45,961 INFO L272 TraceCheckUtils]: 16: Hoare triple {2690#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2690#false} is VALID [2022-04-15 12:49:45,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {2690#false} ~cond := #in~cond; {2690#false} is VALID [2022-04-15 12:49:45,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {2690#false} assume 0 == ~cond; {2690#false} is VALID [2022-04-15 12:49:45,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {2690#false} assume !false; {2690#false} is VALID [2022-04-15 12:49:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:45,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303540716] [2022-04-15 12:49:45,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303540716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:45,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163036631] [2022-04-15 12:49:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:45,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:45,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:45,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:45,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:49:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:46,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:49:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:46,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:46,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {2689#true} call ULTIMATE.init(); {2689#true} is VALID [2022-04-15 12:49:46,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {2689#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2689#true} is VALID [2022-04-15 12:49:46,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {2689#true} assume true; {2689#true} is VALID [2022-04-15 12:49:46,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2689#true} {2689#true} #72#return; {2689#true} is VALID [2022-04-15 12:49:46,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {2689#true} call #t~ret13 := main(); {2689#true} is VALID [2022-04-15 12:49:46,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {2689#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2689#true} is VALID [2022-04-15 12:49:46,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {2689#true} [94] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2689#true} is VALID [2022-04-15 12:49:46,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {2689#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2689#true} is VALID [2022-04-15 12:49:46,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {2689#true} ~z~0 := ~y~0; {2694#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:49:46,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {2694#(= (+ 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; {2695#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:46,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {2695#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2732#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-15 12:49:46,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {2732#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2697#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:46,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#(<= 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; {2690#false} is VALID [2022-04-15 12:49:46,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {2690#false} assume !(~y~0 % 4294967296 > 0); {2690#false} is VALID [2022-04-15 12:49:46,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {2690#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; {2690#false} is VALID [2022-04-15 12:49:46,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {2690#false} assume !(~x~0 % 4294967296 > 0); {2690#false} is VALID [2022-04-15 12:49:46,196 INFO L272 TraceCheckUtils]: 16: Hoare triple {2690#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2690#false} is VALID [2022-04-15 12:49:46,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {2690#false} ~cond := #in~cond; {2690#false} is VALID [2022-04-15 12:49:46,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {2690#false} assume 0 == ~cond; {2690#false} is VALID [2022-04-15 12:49:46,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {2690#false} assume !false; {2690#false} is VALID [2022-04-15 12:49:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:46,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:46,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {2690#false} assume !false; {2690#false} is VALID [2022-04-15 12:49:46,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {2690#false} assume 0 == ~cond; {2690#false} is VALID [2022-04-15 12:49:46,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {2690#false} ~cond := #in~cond; {2690#false} is VALID [2022-04-15 12:49:46,558 INFO L272 TraceCheckUtils]: 16: Hoare triple {2690#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2690#false} is VALID [2022-04-15 12:49:46,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {2690#false} assume !(~x~0 % 4294967296 > 0); {2690#false} is VALID [2022-04-15 12:49:46,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {2690#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; {2690#false} is VALID [2022-04-15 12:49:46,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {2690#false} assume !(~y~0 % 4294967296 > 0); {2690#false} is VALID [2022-04-15 12:49:46,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#(<= 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; {2690#false} is VALID [2022-04-15 12:49:46,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {2732#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2697#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:46,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {2787#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2732#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-15 12:49:46,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2791#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2787#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:49:46,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {2689#true} ~z~0 := ~y~0; {2791#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:49:46,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {2689#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2689#true} is VALID [2022-04-15 12:49:46,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {2689#true} [94] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2689#true} is VALID [2022-04-15 12:49:46,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {2689#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2689#true} is VALID [2022-04-15 12:49:46,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {2689#true} call #t~ret13 := main(); {2689#true} is VALID [2022-04-15 12:49:46,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2689#true} {2689#true} #72#return; {2689#true} is VALID [2022-04-15 12:49:46,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {2689#true} assume true; {2689#true} is VALID [2022-04-15 12:49:46,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2689#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2689#true} is VALID [2022-04-15 12:49:46,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {2689#true} call ULTIMATE.init(); {2689#true} is VALID [2022-04-15 12:49:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:49:46,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163036631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:46,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:46,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 12:49:46,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:46,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189228247] [2022-04-15 12:49:46,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189228247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:46,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:46,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:49:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035279204] [2022-04-15 12:49:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:46,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:49:46,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:46,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:46,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:46,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:49:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:49:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:49:46,606 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:46,923 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 12:49:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:49:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:49:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-15 12:49:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-15 12:49:46,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-15 12:49:46,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:46,956 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:49:46,956 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:49:46,956 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:49:46,957 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:46,957 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:49:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-15 12:49:47,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:47,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:47,019 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:47,019 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:47,020 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:49:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:49:47,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:47,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:47,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:49:47,020 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:49:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:47,021 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:49:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:49:47,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:47,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:47,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:47,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 12:49:47,022 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 20 [2022-04-15 12:49:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:47,022 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 12:49:47,022 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:47,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 12:49:47,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 12:49:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:49:47,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:47,067 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:47,085 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 12:49:47,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:47,268 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash -629354303, now seen corresponding path program 3 times [2022-04-15 12:49:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:47,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920522701] [2022-04-15 12:49:47,350 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash -115019294, now seen corresponding path program 1 times [2022-04-15 12:49:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:47,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33547003] [2022-04-15 12:49:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:47,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {2998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2990#true} is VALID [2022-04-15 12:49:47,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-04-15 12:49:47,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2990#true} {2990#true} #72#return; {2990#true} is VALID [2022-04-15 12:49:47,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {2990#true} call ULTIMATE.init(); {2998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:47,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {2998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2990#true} is VALID [2022-04-15 12:49:47,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-04-15 12:49:47,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2990#true} {2990#true} #72#return; {2990#true} is VALID [2022-04-15 12:49:47,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {2990#true} call #t~ret13 := main(); {2990#true} is VALID [2022-04-15 12:49:47,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {2990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2990#true} is VALID [2022-04-15 12:49:47,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#true} [96] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2990#true} is VALID [2022-04-15 12:49:47,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {2990#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2995#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:47,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {2995#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2995#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:47,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {2995#(<= 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; {2996#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1))} is VALID [2022-04-15 12:49:47,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {2996#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {2997#(<= (+ (* 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; {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {2997#(<= (+ (* 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; {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2991#false} is VALID [2022-04-15 12:49:47,433 INFO L272 TraceCheckUtils]: 16: Hoare triple {2991#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2991#false} is VALID [2022-04-15 12:49:47,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {2991#false} ~cond := #in~cond; {2991#false} is VALID [2022-04-15 12:49:47,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {2991#false} assume 0 == ~cond; {2991#false} is VALID [2022-04-15 12:49:47,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2022-04-15 12:49:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:49:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:47,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33547003] [2022-04-15 12:49:47,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33547003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:47,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658479376] [2022-04-15 12:49:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:47,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:47,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:47,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:47,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:49:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:47,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:49:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:47,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:47,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {2990#true} call ULTIMATE.init(); {2990#true} is VALID [2022-04-15 12:49:47,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2990#true} is VALID [2022-04-15 12:49:47,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-04-15 12:49:47,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2990#true} {2990#true} #72#return; {2990#true} is VALID [2022-04-15 12:49:47,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {2990#true} call #t~ret13 := main(); {2990#true} is VALID [2022-04-15 12:49:47,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {2990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2990#true} is VALID [2022-04-15 12:49:47,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#true} [96] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2990#true} is VALID [2022-04-15 12:49:47,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {2990#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2995#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:47,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {2995#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2995#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:47,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {2995#(<= 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; {3029#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:47,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {3029#(<= 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; {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:47,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:47,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:47,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:47,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:47,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {3033#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2991#false} is VALID [2022-04-15 12:49:47,667 INFO L272 TraceCheckUtils]: 16: Hoare triple {2991#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2991#false} is VALID [2022-04-15 12:49:47,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {2991#false} ~cond := #in~cond; {2991#false} is VALID [2022-04-15 12:49:47,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {2991#false} assume 0 == ~cond; {2991#false} is VALID [2022-04-15 12:49:47,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2022-04-15 12:49:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:49:47,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:47,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2022-04-15 12:49:47,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {2991#false} assume 0 == ~cond; {2991#false} is VALID [2022-04-15 12:49:47,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {2991#false} ~cond := #in~cond; {2991#false} is VALID [2022-04-15 12:49:47,874 INFO L272 TraceCheckUtils]: 16: Hoare triple {2991#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2991#false} is VALID [2022-04-15 12:49:47,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2991#false} is VALID [2022-04-15 12:49:47,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {2997#(<= (+ (* 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; {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {2997#(<= (+ (* 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; {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2997#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:49:47,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {3092#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~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; {3088#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 12:49:47,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {3092#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~0 1))} ~z~0 := ~y~0; {3092#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~0 1))} is VALID [2022-04-15 12:49:47,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {2990#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3092#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~0 1))} is VALID [2022-04-15 12:49:47,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {2990#true} [96] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2990#true} is VALID [2022-04-15 12:49:47,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {2990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2990#true} is VALID [2022-04-15 12:49:47,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {2990#true} call #t~ret13 := main(); {2990#true} is VALID [2022-04-15 12:49:47,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2990#true} {2990#true} #72#return; {2990#true} is VALID [2022-04-15 12:49:47,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} assume true; {2990#true} is VALID [2022-04-15 12:49:47,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2990#true} is VALID [2022-04-15 12:49:47,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {2990#true} call ULTIMATE.init(); {2990#true} is VALID [2022-04-15 12:49:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:49:47,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658479376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:47,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:47,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 12:49:47,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:47,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920522701] [2022-04-15 12:49:47,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920522701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:47,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:47,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:49:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821701614] [2022-04-15 12:49:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:47,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:49:47,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:47,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:47,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:47,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:49:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:49:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:49:47,922 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:48,200 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 12:49:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:49:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:49:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 12:49:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-15 12:49:48,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-15 12:49:48,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:48,241 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:49:48,241 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:49:48,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:49:48,241 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:48,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:49:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-04-15 12:49:48,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:48,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,306 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,306 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:48,307 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 12:49:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-15 12:49:48,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:48,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:48,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:49:48,307 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:49:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:48,308 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 12:49:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-15 12:49:48,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:48,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:48,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:48,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-15 12:49:48,309 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 20 [2022-04-15 12:49:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:48,310 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-15 12:49:48,313 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:48,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-15 12:49:48,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 12:49:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:49:48,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:48,382 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:48,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:48,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:48,601 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1999348183, now seen corresponding path program 4 times [2022-04-15 12:49:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:48,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418738506] [2022-04-15 12:49:48,705 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1527116650, now seen corresponding path program 1 times [2022-04-15 12:49:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:48,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529832466] [2022-04-15 12:49:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:48,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {3334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3324#true} is VALID [2022-04-15 12:49:48,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-04-15 12:49:48,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3324#true} {3324#true} #72#return; {3324#true} is VALID [2022-04-15 12:49:48,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {3324#true} call ULTIMATE.init(); {3334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:48,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {3334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3324#true} is VALID [2022-04-15 12:49:48,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-04-15 12:49:48,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3324#true} {3324#true} #72#return; {3324#true} is VALID [2022-04-15 12:49:48,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {3324#true} call #t~ret13 := main(); {3324#true} is VALID [2022-04-15 12:49:48,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {3324#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3329#(= main_~y~0 0)} is VALID [2022-04-15 12:49:48,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {3329#(= main_~y~0 0)} [98] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3330#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:49:48,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {3330#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3330#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:49:48,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {3330#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {3331#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:49:48,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {3331#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3332#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:48,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {3332#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:48,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:48,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:48,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:48,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:48,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3332#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:48,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {3332#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3325#false} is VALID [2022-04-15 12:49:48,841 INFO L272 TraceCheckUtils]: 17: Hoare triple {3325#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3325#false} is VALID [2022-04-15 12:49:48,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {3325#false} ~cond := #in~cond; {3325#false} is VALID [2022-04-15 12:49:48,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {3325#false} assume 0 == ~cond; {3325#false} is VALID [2022-04-15 12:49:48,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {3325#false} assume !false; {3325#false} is VALID [2022-04-15 12:49:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:49:48,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:48,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529832466] [2022-04-15 12:49:48,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529832466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:48,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707844659] [2022-04-15 12:49:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:48,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:48,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:48,855 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:48,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:49:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:48,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:49:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:48,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:49,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {3324#true} call ULTIMATE.init(); {3324#true} is VALID [2022-04-15 12:49:49,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {3324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3324#true} is VALID [2022-04-15 12:49:49,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {3324#true} assume true; {3324#true} is VALID [2022-04-15 12:49:49,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3324#true} {3324#true} #72#return; {3324#true} is VALID [2022-04-15 12:49:49,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {3324#true} call #t~ret13 := main(); {3324#true} is VALID [2022-04-15 12:49:49,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {3324#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3329#(= main_~y~0 0)} is VALID [2022-04-15 12:49:49,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {3329#(= main_~y~0 0)} [98] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3356#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:49,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {3356#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3356#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:49:49,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {3356#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {3363#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:49:49,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {3363#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 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; {3367#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} is VALID [2022-04-15 12:49:49,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {3367#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3371#(or (= (+ main_~z~0 2) 0) (and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 0 (+ main_~z~0 2))))} is VALID [2022-04-15 12:49:49,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3371#(or (= (+ main_~z~0 2) 0) (and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 0 (+ main_~z~0 2))))} assume !(~z~0 % 4294967296 > 0); {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:49,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:49,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:49,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:49,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3332#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:49,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {3332#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3325#false} is VALID [2022-04-15 12:49:49,306 INFO L272 TraceCheckUtils]: 17: Hoare triple {3325#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3325#false} is VALID [2022-04-15 12:49:49,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {3325#false} ~cond := #in~cond; {3325#false} is VALID [2022-04-15 12:49:49,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {3325#false} assume 0 == ~cond; {3325#false} is VALID [2022-04-15 12:49:49,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {3325#false} assume !false; {3325#false} is VALID [2022-04-15 12:49:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:49:49,306 INFO L328 TraceCheckSpWp]: Computing backward predicates...