/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:07:01,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:07:01,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:07:01,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:07:01,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:07:01,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:07:01,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:07:01,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:07:01,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:07:01,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:07:01,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:07:01,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:07:01,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:07:01,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:07:01,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:07:01,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:07:01,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:07:01,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:07:01,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:07:01,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:07:01,734 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:07:01,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:07:01,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:07:01,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:07:01,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:07:01,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:07:01,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:07:01,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:07:01,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:07:01,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:07:01,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:07:01,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:07:01,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:07:01,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:07:01,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:07:01,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:07:01,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:07:01,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:07:01,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:07:01,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:07:01,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:07:01,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:07:01,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:07:01,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:07:01,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:07:01,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:07:01,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:07:01,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:07:01,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:07:01,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:07:01,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:07:01,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:07:01,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:07:01,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:07:01,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:07:01,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:07:01,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:07:01,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:07:01,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:07:01,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:07:01,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:07:01,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:07:01,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:07:01,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:07:01,760 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:07:01,760 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:07:01,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:07:01,761 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:07:01,761 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-28 03:07:01,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:07:02,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:07:02,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:07:02,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:07:02,014 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:07:02,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-28 03:07:02,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666213249/fc26f386f21b41ec8155b5caf7127567/FLAG8baeec79e [2022-04-28 03:07:02,456 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:07:02,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-28 03:07:02,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666213249/fc26f386f21b41ec8155b5caf7127567/FLAG8baeec79e [2022-04-28 03:07:02,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666213249/fc26f386f21b41ec8155b5caf7127567 [2022-04-28 03:07:02,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:07:02,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:07:02,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:07:02,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:07:02,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:07:02,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:07:02" (1/1) ... [2022-04-28 03:07:02,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d05a6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:02, skipping insertion in model container [2022-04-28 03:07:02,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:07:02" (1/1) ... [2022-04-28 03:07:02,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:07:02,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:07:03,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-28 03:07:03,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:07:03,123 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:07:03,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-28 03:07:03,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:07:03,158 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:07:03,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03 WrapperNode [2022-04-28 03:07:03,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:07:03,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:07:03,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:07:03,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:07:03,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:07:03,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:07:03,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:07:03,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:07:03,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (1/1) ... [2022-04-28 03:07:03,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:07:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:03,222 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-28 03:07:03,224 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-28 03:07:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:07:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:07:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:07:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:07:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:07:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:07:03,293 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:07:03,294 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:07:03,397 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:07:03,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:07:03,404 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:07:03,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:07:03 BoogieIcfgContainer [2022-04-28 03:07:03,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:07:03,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:07:03,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:07:03,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:07:03,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:07:02" (1/3) ... [2022-04-28 03:07:03,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48449e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:07:03, skipping insertion in model container [2022-04-28 03:07:03,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:07:03" (2/3) ... [2022-04-28 03:07:03,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48449e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:07:03, skipping insertion in model container [2022-04-28 03:07:03,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:07:03" (3/3) ... [2022-04-28 03:07:03,422 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2022-04-28 03:07:03,440 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:07:03,455 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:07:03,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:07:03,513 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@419ae1fd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@413f35d [2022-04-28 03:07:03,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:07:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-28 03:07:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:07:03,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:03,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:03,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-28 03:07:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:03,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1972534328] [2022-04-28 03:07:03,545 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:07:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-28 03:07:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:03,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687152455] [2022-04-28 03:07:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:03,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 03:07:03,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 03:07:03,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 03:07:03,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:03,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 03:07:03,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 03:07:03,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 03:07:03,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-28 03:07:03,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-28 03:07:03,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 03:07:03,676 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2022-04-28 03:07:03,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-28 03:07:03,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-28 03:07:03,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 03:07:03,677 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-28 03:07:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:03,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687152455] [2022-04-28 03:07:03,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687152455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:03,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:03,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:07:03,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:03,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1972534328] [2022-04-28 03:07:03,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1972534328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:03,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:03,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:07:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313986682] [2022-04-28 03:07:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:03,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:07:03,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:03,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:03,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:07:03,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:07:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:07:03,726 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:03,782 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:07:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:07:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:07:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 03:07:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 03:07:03,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-28 03:07:03,868 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-28 03:07:03,874 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:07:03,874 INFO L226 Difference]: Without dead ends: 12 [2022-04-28 03:07:03,876 INFO L412 NwaCegarLoop]: 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-28 03:07:03,883 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 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-28 03:07:03,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:07:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-28 03:07:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-28 03:07:03,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:03,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,906 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,906 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:03,908 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 03:07:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:07:03,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:03,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:03,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 03:07:03,910 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 03:07:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:03,912 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 03:07:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:07:03,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:03,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:03,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:03,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 03:07:03,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-28 03:07:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:03,916 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 03:07:03,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:03,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 03:07:03,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:07:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:07:03,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:03,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:03,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:07:03,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:03,935 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-28 03:07:03,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:03,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [568375864] [2022-04-28 03:07:03,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:07:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-28 03:07:03,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:03,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933172537] [2022-04-28 03:07:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:04,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 03:07:04,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 03:07:04,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 03:07:04,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:04,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 03:07:04,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 03:07:04,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 03:07:04,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-28 03:07:04,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-28 03:07:04,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-28 03:07:04,016 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {136#false} is VALID [2022-04-28 03:07:04,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-28 03:07:04,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-28 03:07:04,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-28 03:07:04,017 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-28 03:07:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:04,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933172537] [2022-04-28 03:07:04,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933172537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:04,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:04,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:07:04,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:04,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [568375864] [2022-04-28 03:07:04,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [568375864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:04,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:04,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:07:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279792200] [2022-04-28 03:07:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:07:04,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:04,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:07:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:07:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:07:04,032 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:04,074 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:07:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:07:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:07:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 03:07:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 03:07:04,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-28 03:07:04,095 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-28 03:07:04,096 INFO L225 Difference]: With dead ends: 18 [2022-04-28 03:07:04,097 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:07:04,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:07:04,098 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:04,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:07:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:07:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:07:04,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:04,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,107 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,107 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:04,110 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:07:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:07:04,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:04,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:04,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:07:04,129 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:07:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:04,131 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:07:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:07:04,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:04,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:04,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:04,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 03:07:04,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 03:07:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:04,135 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 03:07:04,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 03:07:04,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:07:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:07:04,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:04,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:04,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:07:04,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-28 03:07:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:04,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241754731] [2022-04-28 03:07:04,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:04,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:07:04,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-28 03:07:04,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:04,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139491066] [2022-04-28 03:07:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:04,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:04,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 03:07:04,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:07:04,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:07:04,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:04,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 03:07:04,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:07:04,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:07:04,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 03:07:04,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-28 03:07:04,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {240#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:07:04,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-28 03:07:04,347 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 03:07:04,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:07:04,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:07:04,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:07:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:04,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139491066] [2022-04-28 03:07:04,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139491066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:04,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727379975] [2022-04-28 03:07:04,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:07:04,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:04,350 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-28 03:07:04,351 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-28 03:07:04,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:07:04,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:04,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:07:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:04,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:04,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 03:07:04,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 03:07:04,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:07:04,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:07:04,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 03:07:04,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-28 03:07:04,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {263#(= main_~x~0 1)} is VALID [2022-04-28 03:07:04,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-28 03:07:04,452 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 03:07:04,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:07:04,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:07:04,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:07:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:04,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:04,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:07:04,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:07:04,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:07:04,517 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 03:07:04,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-28 03:07:04,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {291#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 03:07:04,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {295#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 03:07:04,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-28 03:07:04,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:07:04,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:07:04,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-28 03:07:04,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 03:07:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:04,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727379975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:04,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:04,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 03:07:04,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:04,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241754731] [2022-04-28 03:07:04,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241754731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:04,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:04,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:07:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367361663] [2022-04-28 03:07:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:04,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:07:04,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:04,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:04,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:07:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:07:04,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:07:04,537 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:04,603 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:07:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:07:04,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:07:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 03:07:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 03:07:04,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 03:07:04,635 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-28 03:07:04,637 INFO L225 Difference]: With dead ends: 19 [2022-04-28 03:07:04,637 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:07:04,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:07:04,646 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:04,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:07:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:07:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:07:04,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:04,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,655 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,655 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:04,657 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:07:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:07:04,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:04,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:04,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:07:04,657 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:07:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:04,659 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:07:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:07:04,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:04,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:04,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:04,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 03:07:04,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 03:07:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:04,664 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 03:07:04,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:04,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 03:07:04,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:07:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:07:04,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:04,679 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:04,704 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-28 03:07:04,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:04,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:04,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-28 03:07:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:04,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1891590063] [2022-04-28 03:07:04,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:04,906 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:07:04,907 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-28 03:07:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:04,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593328397] [2022-04-28 03:07:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:05,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:07:05,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:07:05,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:07:05,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:05,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:07:05,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:07:05,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:07:05,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 03:07:05,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0;~y~0 := 1; {419#(= main_~x~0 0)} is VALID [2022-04-28 03:07:05,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 03:07:05,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {421#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:05,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {415#false} is VALID [2022-04-28 03:07:05,049 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 03:07:05,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 03:07:05,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 03:07:05,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 03:07:05,050 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-28 03:07:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593328397] [2022-04-28 03:07:05,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593328397] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382909824] [2022-04-28 03:07:05,051 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:07:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:05,052 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-28 03:07:05,053 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-28 03:07:05,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:07:05,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:05,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:07:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:05,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:05,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 03:07:05,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#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(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:07:05,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:07:05,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:07:05,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 03:07:05,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0;~y~0 := 1; {419#(= main_~x~0 0)} is VALID [2022-04-28 03:07:05,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 03:07:05,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:05,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {415#false} is VALID [2022-04-28 03:07:05,330 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 03:07:05,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 03:07:05,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 03:07:05,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 03:07:05,331 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-28 03:07:05,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:05,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 03:07:05,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 03:07:05,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 03:07:05,405 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 03:07:05,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {415#false} is VALID [2022-04-28 03:07:05,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {475#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 03:07:05,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {479#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 03:07:05,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0;~y~0 := 1; {483#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-28 03:07:05,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret5 := main(); {414#true} is VALID [2022-04-28 03:07:05,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:07:05,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:07:05,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#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(18, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:07:05,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 03:07:05,413 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-28 03:07:05,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382909824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:05,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:05,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 03:07:05,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:05,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1891590063] [2022-04-28 03:07:05,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1891590063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:05,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:05,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:07:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321000621] [2022-04-28 03:07:05,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:05,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:07:05,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:05,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:05,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:07:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:05,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:07:05,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:07:05,429 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:05,517 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:07:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:07:05,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:07:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 03:07:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 03:07:05,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 03:07:05,540 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-28 03:07:05,542 INFO L225 Difference]: With dead ends: 20 [2022-04-28 03:07:05,542 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:07:05,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:07:05,544 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:05,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:07:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:07:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:07:05,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:05,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,553 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,553 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:05,554 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:07:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:07:05,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:05,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:05,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:07:05,555 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:07:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:05,556 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:07:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:07:05,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:05,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:05,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:05,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:07:05,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 03:07:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:05,558 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:07:05,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:05,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:07:05,572 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-28 03:07:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:07:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:07:05,572 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:05,572 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:05,591 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-28 03:07:05,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 03:07:05,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-28 03:07:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:05,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087330968] [2022-04-28 03:07:05,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:05,789 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:07:05,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-28 03:07:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:05,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112101833] [2022-04-28 03:07:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:05,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:07:05,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:07:05,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:07:05,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:05,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:07:05,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:07:05,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:07:05,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 03:07:05,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0;~y~0 := 1; {615#(= main_~x~0 0)} is VALID [2022-04-28 03:07:05,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {616#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 03:07:05,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:05,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 03:07:05,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 6); {611#false} is VALID [2022-04-28 03:07:05,892 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-28 03:07:05,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-28 03:07:05,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:07:05,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:07:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112101833] [2022-04-28 03:07:05,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112101833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293910668] [2022-04-28 03:07:05,893 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:07:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:05,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:05,895 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-28 03:07:05,907 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-28 03:07:05,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:07:05,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:05,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:07:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:05,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:06,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 03:07:06,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#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(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:07:06,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:07:06,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:07:06,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 03:07:06,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0;~y~0 := 1; {638#(= main_~y~0 1)} is VALID [2022-04-28 03:07:06,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {638#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {642#(= main_~y~0 2)} is VALID [2022-04-28 03:07:06,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {646#(= main_~y~0 4)} is VALID [2022-04-28 03:07:06,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {646#(= main_~y~0 4)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {650#(= main_~y~0 8)} is VALID [2022-04-28 03:07:06,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#(= main_~y~0 8)} assume !(~x~0 % 4294967296 < 6); {650#(= main_~y~0 8)} is VALID [2022-04-28 03:07:06,045 INFO L272 TraceCheckUtils]: 10: Hoare triple {650#(= main_~y~0 8)} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {657#(= 2 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:07:06,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(= 2 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {661#(= 2 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:07:06,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(= 2 __VERIFIER_assert_~cond)} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:07:06,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:07:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:06,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:10,420 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod c_main_~y~0 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 03:07:16,944 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod (* 2 c_main_~y~0) 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 03:07:21,293 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod (* 4 c_main_~y~0) 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 03:07:25,634 WARN L833 $PredicateComparison]: unable to prove that (not (= (mod (mod (mod (* 8 c_main_~y~0) 4294967296) 3) 4294967296) 0)) is different from false [2022-04-28 03:07:25,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:07:25,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {671#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:07:25,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {671#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:07:25,663 INFO L272 TraceCheckUtils]: 10: Hoare triple {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:07:25,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} assume !(~x~0 % 4294967296 < 6); {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} is VALID [2022-04-28 03:07:27,829 WARN L290 TraceCheckUtils]: 8: Hoare triple {686#(not (= (mod (mod (mod (* main_~y~0 2) 4294967296) 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {679#(not (= (mod (mod (mod main_~y~0 4294967296) 3) 4294967296) 0))} is UNKNOWN [2022-04-28 03:07:30,027 WARN L290 TraceCheckUtils]: 7: Hoare triple {690#(not (= (mod (mod (mod (* main_~y~0 4) 4294967296) 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {686#(not (= (mod (mod (mod (* main_~y~0 2) 4294967296) 3) 4294967296) 0))} is UNKNOWN [2022-04-28 03:07:32,191 WARN L290 TraceCheckUtils]: 6: Hoare triple {694#(not (= (mod (mod (mod (* main_~y~0 8) 4294967296) 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {690#(not (= (mod (mod (mod (* main_~y~0 4) 4294967296) 3) 4294967296) 0))} is UNKNOWN [2022-04-28 03:07:32,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0;~y~0 := 1; {694#(not (= (mod (mod (mod (* main_~y~0 8) 4294967296) 3) 4294967296) 0))} is VALID [2022-04-28 03:07:32,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 03:07:32,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:07:32,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:07:32,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#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(18, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:07:32,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 03:07:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-04-28 03:07:32,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293910668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:32,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:32,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-04-28 03:07:32,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:32,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087330968] [2022-04-28 03:07:32,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087330968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:32,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:32,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:07:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034611426] [2022-04-28 03:07:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:07:32,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:32,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:32,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:07:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:32,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:07:32,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=182, Unknown=4, NotChecked=116, Total=342 [2022-04-28 03:07:32,214 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:32,475 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:07:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:07:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:07:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 03:07:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 03:07:32,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 03:07:32,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:32,500 INFO L225 Difference]: With dead ends: 21 [2022-04-28 03:07:32,500 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:07:32,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=62, Invalid=292, Unknown=4, NotChecked=148, Total=506 [2022-04-28 03:07:32,502 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:32,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:07:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:07:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:07:32,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:32,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,511 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,511 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:32,512 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:07:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:07:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:32,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states 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-28 03:07:32,513 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states 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-28 03:07:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:32,514 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:07:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:07:32,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:32,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:32,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:32,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 03:07:32,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 03:07:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:32,516 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 03:07:32,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:32,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 03:07:32,536 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-28 03:07:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:07:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:07:32,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:32,537 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:32,562 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-28 03:07:32,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:32,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-28 03:07:32,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:32,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293385805] [2022-04-28 03:07:32,742 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:32,742 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:07:32,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-28 03:07:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:32,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584227089] [2022-04-28 03:07:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:32,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:32,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:32,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 03:07:32,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 03:07:32,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 03:07:32,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:32,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 03:07:32,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 03:07:32,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 03:07:32,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret5 := main(); {829#true} is VALID [2022-04-28 03:07:32,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} ~x~0 := 0;~y~0 := 1; {834#(= main_~x~0 0)} is VALID [2022-04-28 03:07:32,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 03:07:32,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:32,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 03:07:32,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {838#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:07:32,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {830#false} is VALID [2022-04-28 03:07:32,904 INFO L272 TraceCheckUtils]: 11: Hoare triple {830#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {830#false} is VALID [2022-04-28 03:07:32,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#false} ~cond := #in~cond; {830#false} is VALID [2022-04-28 03:07:32,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#false} assume 0 == ~cond; {830#false} is VALID [2022-04-28 03:07:32,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#false} assume !false; {830#false} is VALID [2022-04-28 03:07:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:32,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584227089] [2022-04-28 03:07:32,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584227089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:32,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037844242] [2022-04-28 03:07:32,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:07:32,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:32,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:32,907 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-28 03:07:32,908 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-28 03:07:32,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:07:32,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:32,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:07:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:32,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:33,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2022-04-28 03:07:33,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#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(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 03:07:33,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 03:07:33,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 03:07:33,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret5 := main(); {829#true} is VALID [2022-04-28 03:07:33,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} ~x~0 := 0;~y~0 := 1; {834#(= main_~x~0 0)} is VALID [2022-04-28 03:07:33,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 03:07:33,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:33,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 03:07:33,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {870#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:33,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {870#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {830#false} is VALID [2022-04-28 03:07:33,219 INFO L272 TraceCheckUtils]: 11: Hoare triple {830#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {830#false} is VALID [2022-04-28 03:07:33,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#false} ~cond := #in~cond; {830#false} is VALID [2022-04-28 03:07:33,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#false} assume 0 == ~cond; {830#false} is VALID [2022-04-28 03:07:33,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#false} assume !false; {830#false} is VALID [2022-04-28 03:07:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:33,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:33,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#false} assume !false; {830#false} is VALID [2022-04-28 03:07:33,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#false} assume 0 == ~cond; {830#false} is VALID [2022-04-28 03:07:33,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#false} ~cond := #in~cond; {830#false} is VALID [2022-04-28 03:07:33,386 INFO L272 TraceCheckUtils]: 11: Hoare triple {830#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {830#false} is VALID [2022-04-28 03:07:33,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {830#false} is VALID [2022-04-28 03:07:33,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {902#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {898#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 03:07:33,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {902#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 03:07:33,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#(< (mod (+ main_~x~0 3) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {906#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-28 03:07:33,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {914#(< (mod (+ main_~x~0 4) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {910#(< (mod (+ main_~x~0 3) 4294967296) 6)} is VALID [2022-04-28 03:07:33,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {829#true} ~x~0 := 0;~y~0 := 1; {914#(< (mod (+ main_~x~0 4) 4294967296) 6)} is VALID [2022-04-28 03:07:33,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret5 := main(); {829#true} is VALID [2022-04-28 03:07:33,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2022-04-28 03:07:33,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2022-04-28 03:07:33,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#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(18, 2);call #Ultimate.allocInit(12, 3); {829#true} is VALID [2022-04-28 03:07:33,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2022-04-28 03:07:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:33,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037844242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:33,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:33,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 03:07:33,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293385805] [2022-04-28 03:07:33,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293385805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:33,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:33,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:07:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82186821] [2022-04-28 03:07:33,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-28 03:07:33,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:33,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-28 03:07:33,409 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-28 03:07:33,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:07:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:33,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:07:33,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:07:33,410 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-28 03:07:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:33,653 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:07:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:07:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-28 03:07:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-28 03:07:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 03:07:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-28 03:07:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 03:07:33,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 03:07:33,676 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-28 03:07:33,677 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:07:33,678 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:07:33,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:07:33,679 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:33,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:07:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:07:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:07:33,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:33,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,688 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,689 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:33,689 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:07:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:07:33,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:33,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:33,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:07:33,690 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:07:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:33,691 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:07:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:07:33,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:33,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:33,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:33,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 03:07:33,692 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 03:07:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:33,693 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 03:07:33,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-28 03:07:33,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 03:07:33,711 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-28 03:07:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:07:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:07:33,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:33,712 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:33,739 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-28 03:07:33,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:33,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-28 03:07:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [534923034] [2022-04-28 03:07:33,916 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:33,916 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:07:33,916 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-28 03:07:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:33,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736702237] [2022-04-28 03:07:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:34,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 03:07:34,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 03:07:34,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 03:07:34,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:34,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 03:07:34,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 03:07:34,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 03:07:34,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {1057#true} call #t~ret5 := main(); {1057#true} is VALID [2022-04-28 03:07:34,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1057#true} ~x~0 := 0;~y~0 := 1; {1062#(= main_~x~0 0)} is VALID [2022-04-28 03:07:34,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {1062#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 03:07:34,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:34,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 03:07:34,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:34,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 03:07:34,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1058#false} is VALID [2022-04-28 03:07:34,104 INFO L272 TraceCheckUtils]: 12: Hoare triple {1058#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1058#false} is VALID [2022-04-28 03:07:34,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-28 03:07:34,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-28 03:07:34,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-28 03:07:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:34,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736702237] [2022-04-28 03:07:34,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736702237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:34,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771769212] [2022-04-28 03:07:34,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:07:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:34,112 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-28 03:07:34,113 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-28 03:07:34,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:07:34,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:34,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 03:07:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:34,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:34,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-28 03:07:34,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#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(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 03:07:34,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 03:07:34,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 03:07:34,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {1057#true} call #t~ret5 := main(); {1057#true} is VALID [2022-04-28 03:07:34,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {1057#true} ~x~0 := 0;~y~0 := 1; {1062#(= main_~x~0 0)} is VALID [2022-04-28 03:07:34,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {1062#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 03:07:34,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:34,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1064#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 03:07:34,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1065#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:34,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1066#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 03:07:34,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1058#false} is VALID [2022-04-28 03:07:34,434 INFO L272 TraceCheckUtils]: 12: Hoare triple {1058#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1058#false} is VALID [2022-04-28 03:07:34,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-28 03:07:34,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-28 03:07:34,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-28 03:07:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:34,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:34,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-28 03:07:34,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-28 03:07:34,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-28 03:07:34,644 INFO L272 TraceCheckUtils]: 12: Hoare triple {1058#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1058#false} is VALID [2022-04-28 03:07:34,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {1130#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {1058#false} is VALID [2022-04-28 03:07:34,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {1134#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1130#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-28 03:07:34,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1134#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-28 03:07:34,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(< (mod (+ main_~x~0 3) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1138#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-28 03:07:34,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {1146#(< (mod (+ main_~x~0 4) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1142#(< (mod (+ main_~x~0 3) 4294967296) 6)} is VALID [2022-04-28 03:07:34,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#(< (mod (+ 5 main_~x~0) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1146#(< (mod (+ main_~x~0 4) 4294967296) 6)} is VALID [2022-04-28 03:07:34,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {1057#true} ~x~0 := 0;~y~0 := 1; {1150#(< (mod (+ 5 main_~x~0) 4294967296) 6)} is VALID [2022-04-28 03:07:34,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {1057#true} call #t~ret5 := main(); {1057#true} is VALID [2022-04-28 03:07:34,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1057#true} {1057#true} #34#return; {1057#true} is VALID [2022-04-28 03:07:34,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-28 03:07:34,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#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(18, 2);call #Ultimate.allocInit(12, 3); {1057#true} is VALID [2022-04-28 03:07:34,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-28 03:07:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:34,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771769212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:34,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:34,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 03:07:34,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:34,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [534923034] [2022-04-28 03:07:34,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [534923034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:34,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:34,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:07:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478562052] [2022-04-28 03:07:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:34,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 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-28 03:07:34,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:34,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 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-28 03:07:34,672 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-28 03:07:34,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:07:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:34,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:07:34,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:07:34,673 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 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-28 03:07:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:35,059 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:07:35,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:07:35,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 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-28 03:07:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 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-28 03:07:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 03:07:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 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-28 03:07:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 03:07:35,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 03:07:35,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:35,084 INFO L225 Difference]: With dead ends: 23 [2022-04-28 03:07:35,084 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:07:35,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:07:35,085 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:35,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:07:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:07:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:07:35,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:35,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:35,096 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:35,096 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:35,097 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:07:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:07:35,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:35,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:35,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:07:35,098 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:07:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:35,098 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:07:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:07:35,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:35,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:35,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:35,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 03:07:35,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 03:07:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:35,100 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 03:07:35,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 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-28 03:07:35,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 03:07:35,119 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-28 03:07:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:07:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:07:35,119 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:35,120 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:35,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:07:35,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:35,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-28 03:07:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:35,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238052789] [2022-04-28 03:07:35,323 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:35,323 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 03:07:35,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:07:35,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-28 03:07:35,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:35,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288459067] [2022-04-28 03:07:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:35,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:36,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:36,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1301#true} is VALID [2022-04-28 03:07:36,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1301#true} assume true; {1301#true} is VALID [2022-04-28 03:07:36,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1301#true} {1301#true} #34#return; {1301#true} is VALID [2022-04-28 03:07:36,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {1301#true} call ULTIMATE.init(); {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:36,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1301#true} is VALID [2022-04-28 03:07:36,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1301#true} assume true; {1301#true} is VALID [2022-04-28 03:07:36,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1301#true} {1301#true} #34#return; {1301#true} is VALID [2022-04-28 03:07:36,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {1301#true} call #t~ret5 := main(); {1301#true} is VALID [2022-04-28 03:07:36,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {1301#true} ~x~0 := 0;~y~0 := 1; {1306#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 03:07:36,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#(= (+ (- 1) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1307#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} is VALID [2022-04-28 03:07:36,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {1307#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1308#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} is VALID [2022-04-28 03:07:36,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1309#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} is VALID [2022-04-28 03:07:36,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {1309#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1310#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} is VALID [2022-04-28 03:07:36,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {1310#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1311#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} is VALID [2022-04-28 03:07:37,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {1311#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is VALID [2022-04-28 03:07:37,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} assume !(~x~0 % 4294967296 < 6); {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is VALID [2022-04-28 03:07:37,291 INFO L272 TraceCheckUtils]: 13: Hoare triple {1312#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1313#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:07:37,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1314#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:07:37,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {1314#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1302#false} is VALID [2022-04-28 03:07:37,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#false} assume !false; {1302#false} is VALID [2022-04-28 03:07:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:37,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288459067] [2022-04-28 03:07:37,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288459067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:37,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289296122] [2022-04-28 03:07:37,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:07:37,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:37,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:37,294 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-28 03:07:37,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process