/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:49:03,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:49:03,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:49:03,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:49:03,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:49:03,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:49:03,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:49:03,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:49:03,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:49:03,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:49:03,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:49:03,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:49:03,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:49:03,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:49:03,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:49:03,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:49:03,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:49:03,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:49:03,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:49:03,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:49:03,879 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:49:03,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:49:03,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:49:03,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:49:03,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:49:03,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:49:03,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:49:03,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:49:03,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:49:03,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:49:03,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:49:03,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:49:03,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:49:03,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:49:03,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:49:03,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:49:03,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:49:03,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:49:03,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:49:03,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:49:03,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:49:03,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:49:03,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:49:03,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:49:03,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:49:03,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:49:03,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:49:03,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:49:03,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:49:03,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:49:03,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:49:03,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:49:03,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:49:03,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:49:03,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:49:03,921 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:49:03,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:49:03,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:49:03,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:49:03,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:49:03,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:49:03,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:49:03,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:49:03,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:49:03,922 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:49:03,922 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:49:03,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:49:03,922 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:49:03,923 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-08 03:49:04,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:49:04,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:49:04,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:49:04,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:49:04,152 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:49:04,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-08 03:49:04,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0faa17919/2f70da5df6f34353af43bab08ced99d6/FLAG5eada229d [2022-04-08 03:49:04,571 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:49:04,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-08 03:49:04,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0faa17919/2f70da5df6f34353af43bab08ced99d6/FLAG5eada229d [2022-04-08 03:49:04,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0faa17919/2f70da5df6f34353af43bab08ced99d6 [2022-04-08 03:49:04,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:49:04,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:49:04,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:49:04,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:49:04,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:49:04,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bd8d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04, skipping insertion in model container [2022-04-08 03:49:04,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:49:04,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:49:04,812 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-1.c[327,340] [2022-04-08 03:49:04,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:49:04,854 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:49:04,865 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-1.c[327,340] [2022-04-08 03:49:04,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:49:04,883 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:49:04,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04 WrapperNode [2022-04-08 03:49:04,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:49:04,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:49:04,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:49:04,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:49:04,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:49:04,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:49:04,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:49:04,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:49:04,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (1/1) ... [2022-04-08 03:49:04,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:49:04,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:04,953 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-08 03:49:04,963 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-08 03:49:04,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:49:04,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:49:04,988 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:49:04,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:49:04,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:49:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:49:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:49:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:49:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:49:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:49:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:49:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:49:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:49:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:49:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:49:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:49:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:49:05,040 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:49:05,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:49:05,118 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:49:05,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:49:05,124 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:49:05,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:49:05 BoogieIcfgContainer [2022-04-08 03:49:05,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:49:05,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:49:05,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:49:05,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:49:05,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:49:04" (1/3) ... [2022-04-08 03:49:05,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f263d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:49:05, skipping insertion in model container [2022-04-08 03:49:05,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:49:04" (2/3) ... [2022-04-08 03:49:05,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f263d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:49:05, skipping insertion in model container [2022-04-08 03:49:05,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:49:05" (3/3) ... [2022-04-08 03:49:05,133 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-1.c [2022-04-08 03:49:05,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:49:05,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:49:05,181 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:49:05,188 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:49:05,188 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:49:05,203 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-08 03:49:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:49:05,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:05,210 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:05,211 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-08 03:49:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:05,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204223312] [2022-04-08 03:49:05,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:49:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-08 03:49:05,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:05,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091160039] [2022-04-08 03:49:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:05,436 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-08 03:49:05,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 03:49:05,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-08 03:49:05,438 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-08 03:49:05,438 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-08 03:49:05,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 03:49:05,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-08 03:49:05,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-08 03:49:05,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-08 03:49:05,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-08 03:49:05,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-08 03:49:05,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-08 03:49:05,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-08 03:49:05,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-08 03:49:05,441 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-08 03:49:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:05,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091160039] [2022-04-08 03:49:05,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091160039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:05,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:05,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:49:05,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:05,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204223312] [2022-04-08 03:49:05,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204223312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:05,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:05,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:49:05,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210004806] [2022-04-08 03:49:05,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:05,450 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-08 03:49:05,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:05,454 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-08 03:49:05,481 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-08 03:49:05,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:49:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:49:05,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:49:05,511 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-08 03:49:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:05,613 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 03:49:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:49:05,613 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-08 03:49:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:05,615 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-08 03:49:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-08 03:49:05,625 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-08 03:49:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-08 03:49:05,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-08 03:49:05,697 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-08 03:49:05,704 INFO L225 Difference]: With dead ends: 29 [2022-04-08 03:49:05,704 INFO L226 Difference]: Without dead ends: 12 [2022-04-08 03:49:05,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:49:05,715 INFO L913 BasicCegarLoop]: 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-08 03:49:05,717 INFO L914 BasicCegarLoop]: 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-08 03:49:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-08 03:49:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-08 03:49:05,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:05,755 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-08 03:49:05,756 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-08 03:49:05,756 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-08 03:49:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:05,762 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-08 03:49:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 03:49:05,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:05,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:05,763 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-08 03:49:05,763 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-08 03:49:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:05,766 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-08 03:49:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 03:49:05,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:05,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:05,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:05,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:05,768 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-08 03:49:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-08 03:49:05,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-08 03:49:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:05,771 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-08 03:49:05,772 INFO L479 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-08 03:49:05,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-08 03:49:05,797 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-08 03:49:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 03:49:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:49:05,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:05,804 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:05,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:49:05,807 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-08 03:49:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:05,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462797253] [2022-04-08 03:49:05,809 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:49:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-08 03:49:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:05,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945023683] [2022-04-08 03:49:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:05,911 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-08 03:49:05,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-08 03:49:05,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-08 03:49:05,913 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-08 03:49:05,913 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-08 03:49:05,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-08 03:49:05,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-08 03:49:05,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-08 03:49:05,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-08 03:49:05,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-08 03:49:05,915 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-08 03:49:05,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-08 03:49:05,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-08 03:49:05,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-08 03:49:05,916 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-08 03:49:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945023683] [2022-04-08 03:49:05,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945023683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:05,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:05,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:49:05,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462797253] [2022-04-08 03:49:05,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462797253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:05,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:05,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:49:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469524831] [2022-04-08 03:49:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:05,941 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-08 03:49:05,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:05,942 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-08 03:49:05,975 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-08 03:49:05,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:49:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:49:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:49:05,976 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-08 03:49:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:06,029 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 03:49:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:49:06,029 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-08 03:49:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:06,030 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-08 03:49:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-08 03:49:06,031 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-08 03:49:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-08 03:49:06,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-08 03:49:06,053 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-08 03:49:06,054 INFO L225 Difference]: With dead ends: 18 [2022-04-08 03:49:06,054 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 03:49:06,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:49:06,055 INFO L913 BasicCegarLoop]: 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-08 03:49:06,056 INFO L914 BasicCegarLoop]: 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-08 03:49:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 03:49:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 03:49:06,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:06,060 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-08 03:49:06,060 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-08 03:49:06,060 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-08 03:49:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:06,061 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 03:49:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 03:49:06,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:06,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:06,062 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-08 03:49:06,062 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-08 03:49:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:06,067 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 03:49:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 03:49:06,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:06,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:06,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:06,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:06,068 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-08 03:49:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 03:49:06,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 03:49:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:06,070 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 03:49:06,071 INFO L479 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-08 03:49:06,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 03:49:06,087 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-08 03:49:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 03:49:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:49:06,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:06,088 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:06,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:49:06,088 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-08 03:49:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:06,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1395055724] [2022-04-08 03:49:06,123 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:06,123 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:49:06,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-08 03:49:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:06,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114151458] [2022-04-08 03:49:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:06,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:06,263 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-08 03:49:06,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 03:49:06,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 03:49:06,266 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-08 03:49:06,266 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-08 03:49:06,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 03:49:06,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 03:49:06,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 03:49:06,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-08 03:49:06,272 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-08 03:49:06,273 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-08 03:49:06,273 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-08 03:49:06,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-08 03:49:06,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-08 03:49:06,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 03:49:06,274 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-08 03:49:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114151458] [2022-04-08 03:49:06,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114151458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891135353] [2022-04-08 03:49:06,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:49:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:06,280 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-08 03:49:06,285 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-08 03:49:06,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:49:06,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:06,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:49:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:06,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:06,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-08 03:49:06,482 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-08 03:49:06,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 03:49:06,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 03:49:06,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 03:49:06,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {260#(= main_~y~0 1)} is VALID [2022-04-08 03:49:06,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(= 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; {264#(= main_~y~0 2)} is VALID [2022-04-08 03:49:06,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(= main_~y~0 2)} assume !(~x~0 % 4294967296 < 6); {264#(= main_~y~0 2)} is VALID [2022-04-08 03:49:06,490 INFO L272 TraceCheckUtils]: 8: Hoare triple {264#(= main_~y~0 2)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:06,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:06,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {235#false} is VALID [2022-04-08 03:49:06,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 03:49:06,493 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-08 03:49:06,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:06,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 03:49:06,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {235#false} is VALID [2022-04-08 03:49:06,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:06,655 INFO L272 TraceCheckUtils]: 8: Hoare triple {291#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:06,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {291#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:06,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {291#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:06,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {298#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 03:49:06,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 03:49:06,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 03:49:06,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 03:49:06,659 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-08 03:49:06,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-08 03:49:06,660 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-08 03:49:06,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891135353] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:06,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:06,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-08 03:49:06,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:06,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1395055724] [2022-04-08 03:49:06,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1395055724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:06,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:06,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:49:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224143834] [2022-04-08 03:49:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:06,664 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-08 03:49:06,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:06,664 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-08 03:49:06,675 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-08 03:49:06,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:49:06,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:49:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:49:06,677 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-08 03:49:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:06,745 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 03:49:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:49:06,746 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-08 03:49:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:06,748 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-08 03:49:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 03:49:06,749 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-08 03:49:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 03:49:06,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-08 03:49:06,785 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-08 03:49:06,787 INFO L225 Difference]: With dead ends: 19 [2022-04-08 03:49:06,788 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 03:49:06,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:49:06,796 INFO L913 BasicCegarLoop]: 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-08 03:49:06,797 INFO L914 BasicCegarLoop]: 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-08 03:49:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 03:49:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 03:49:06,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:06,802 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-08 03:49:06,803 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-08 03:49:06,803 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-08 03:49:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:06,804 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 03:49:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 03:49:06,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:06,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:06,805 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-08 03:49:06,805 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-08 03:49:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:06,806 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 03:49:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 03:49:06,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:06,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:06,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:06,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:06,806 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-08 03:49:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 03:49:06,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-08 03:49:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:06,808 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 03:49:06,808 INFO L479 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-08 03:49:06,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 03:49:06,821 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-08 03:49:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 03:49:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:49:06,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:06,822 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:06,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 03:49:07,044 WARN L460 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-08 03:49:07,044 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-08 03:49:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:07,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213607323] [2022-04-08 03:49:07,050 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:07,051 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:49:07,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-08 03:49:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:07,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015332098] [2022-04-08 03:49:07,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:07,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:07,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(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); {417#true} is VALID [2022-04-08 03:49:07,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 03:49:07,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 03:49:07,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:07,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(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); {417#true} is VALID [2022-04-08 03:49:07,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 03:49:07,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 03:49:07,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 03:49:07,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {422#(= main_~x~0 0)} is VALID [2022-04-08 03:49:07,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= 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; {423#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 03:49:07,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(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; {424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 03:49:07,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {418#false} is VALID [2022-04-08 03:49:07,139 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-08 03:49:07,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-08 03:49:07,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-08 03:49:07,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 03:49:07,140 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-08 03:49:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:07,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015332098] [2022-04-08 03:49:07,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015332098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:07,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853945431] [2022-04-08 03:49:07,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:49:07,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:07,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:07,142 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-08 03:49:07,155 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-08 03:49:07,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:49:07,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:07,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 03:49:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:07,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:07,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 03:49:07,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#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); {417#true} is VALID [2022-04-08 03:49:07,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 03:49:07,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 03:49:07,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 03:49:07,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {444#(= main_~y~0 1)} is VALID [2022-04-08 03:49:07,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(= 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; {448#(= main_~y~0 2)} is VALID [2022-04-08 03:49:07,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {448#(= 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; {452#(= main_~y~0 4)} is VALID [2022-04-08 03:49:07,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#(= main_~y~0 4)} assume !(~x~0 % 4294967296 < 6); {452#(= main_~y~0 4)} is VALID [2022-04-08 03:49:07,317 INFO L272 TraceCheckUtils]: 9: Hoare triple {452#(= main_~y~0 4)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:07,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:07,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {418#false} is VALID [2022-04-08 03:49:07,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 03:49:07,319 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-08 03:49:07,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:07,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 03:49:07,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {418#false} is VALID [2022-04-08 03:49:07,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:07,483 INFO L272 TraceCheckUtils]: 9: Hoare triple {479#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:07,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {479#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:07,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {479#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:07,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {486#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 03:49:07,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {490#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 03:49:07,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 03:49:07,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 03:49:07,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 03:49:07,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#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); {417#true} is VALID [2022-04-08 03:49:07,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 03:49:07,489 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-08 03:49:07,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853945431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:07,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:07,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-04-08 03:49:07,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:07,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213607323] [2022-04-08 03:49:07,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213607323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:07,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:07,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:49:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4626709] [2022-04-08 03:49:07,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:07,491 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-08 03:49:07,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:07,491 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-08 03:49:07,506 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-08 03:49:07,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:49:07,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:49:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:49:07,507 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-08 03:49:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:07,607 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 03:49:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:49:07,607 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-08 03:49:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:07,608 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-08 03:49:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 03:49:07,611 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-08 03:49:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 03:49:07,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 03:49:07,631 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-08 03:49:07,632 INFO L225 Difference]: With dead ends: 20 [2022-04-08 03:49:07,632 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 03:49:07,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:49:07,635 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:07,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:49:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 03:49:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 03:49:07,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:07,651 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-08 03:49:07,651 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-08 03:49:07,652 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-08 03:49:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:07,656 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 03:49:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 03:49:07,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:07,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:07,657 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-08 03:49:07,657 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-08 03:49:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:07,660 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 03:49:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 03:49:07,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:07,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:07,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:07,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:07,661 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-08 03:49:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 03:49:07,661 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 03:49:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:07,662 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 03:49:07,662 INFO L479 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-08 03:49:07,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 03:49:07,674 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-08 03:49:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 03:49:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:49:07,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:07,675 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:07,691 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-08 03:49:07,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 03:49:07,880 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-08 03:49:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:07,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751016134] [2022-04-08 03:49:07,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:07,883 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:49:07,883 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-08 03:49:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607857852] [2022-04-08 03:49:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:07,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {626#(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); {617#true} is VALID [2022-04-08 03:49:07,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 03:49:07,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 03:49:07,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:07,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#(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); {617#true} is VALID [2022-04-08 03:49:07,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 03:49:07,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 03:49:07,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret5 := main(); {617#true} is VALID [2022-04-08 03:49:07,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#true} ~x~0 := 0;~y~0 := 1; {622#(= main_~x~0 0)} is VALID [2022-04-08 03:49:07,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {622#(= 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; {623#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 03:49:07,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#(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; {624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 03:49:07,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(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; {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-08 03:49:07,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 6); {618#false} is VALID [2022-04-08 03:49:07,992 INFO L272 TraceCheckUtils]: 10: Hoare triple {618#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {618#false} is VALID [2022-04-08 03:49:07,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {618#false} ~cond := #in~cond; {618#false} is VALID [2022-04-08 03:49:07,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#false} assume 0 == ~cond; {618#false} is VALID [2022-04-08 03:49:07,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#false} assume !false; {618#false} is VALID [2022-04-08 03:49:07,992 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-08 03:49:07,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:07,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607857852] [2022-04-08 03:49:07,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607857852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:07,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227032152] [2022-04-08 03:49:07,993 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:49:07,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:08,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:08,003 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-08 03:49:08,035 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-08 03:49:08,055 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 03:49:08,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:08,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 03:49:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:08,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:08,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {617#true} is VALID [2022-04-08 03:49:08,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#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); {617#true} is VALID [2022-04-08 03:49:08,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 03:49:08,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 03:49:08,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret5 := main(); {617#true} is VALID [2022-04-08 03:49:08,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#true} ~x~0 := 0;~y~0 := 1; {645#(= main_~y~0 1)} is VALID [2022-04-08 03:49:08,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {645#(= 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; {649#(= main_~y~0 2)} is VALID [2022-04-08 03:49:08,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(= 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; {653#(= main_~y~0 4)} is VALID [2022-04-08 03:49:08,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(= 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; {657#(= main_~y~0 8)} is VALID [2022-04-08 03:49:08,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(= main_~y~0 8)} assume !(~x~0 % 4294967296 < 6); {657#(= main_~y~0 8)} is VALID [2022-04-08 03:49:08,166 INFO L272 TraceCheckUtils]: 10: Hoare triple {657#(= main_~y~0 8)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:08,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:08,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {618#false} is VALID [2022-04-08 03:49:08,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#false} assume !false; {618#false} is VALID [2022-04-08 03:49:08,168 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-08 03:49:08,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:08,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#false} assume !false; {618#false} is VALID [2022-04-08 03:49:08,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {618#false} is VALID [2022-04-08 03:49:08,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:08,333 INFO L272 TraceCheckUtils]: 10: Hoare triple {684#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:08,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {684#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {684#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:08,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {691#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {684#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:08,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {691#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 03:49:08,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#(not (= (mod (* main_~y~0 8) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {695#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 03:49:08,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#true} ~x~0 := 0;~y~0 := 1; {699#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-08 03:49:08,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret5 := main(); {617#true} is VALID [2022-04-08 03:49:08,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 03:49:08,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 03:49:08,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#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); {617#true} is VALID [2022-04-08 03:49:08,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {617#true} is VALID [2022-04-08 03:49:08,339 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-08 03:49:08,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227032152] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:08,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:08,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-04-08 03:49:08,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:08,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751016134] [2022-04-08 03:49:08,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751016134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:08,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:49:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582080049] [2022-04-08 03:49:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:08,340 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-08 03:49:08,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:08,341 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-08 03:49:08,352 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-08 03:49:08,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:49:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:08,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:49:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:49:08,354 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-08 03:49:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:08,502 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 03:49:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:49:08,502 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-08 03:49:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:08,502 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-08 03:49:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 03:49:08,504 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-08 03:49:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 03:49:08,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-08 03:49:08,525 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-08 03:49:08,526 INFO L225 Difference]: With dead ends: 21 [2022-04-08 03:49:08,526 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 03:49:08,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-08 03:49:08,527 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:08,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:49:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 03:49:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 03:49:08,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:08,541 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-08 03:49:08,542 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-08 03:49:08,542 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-08 03:49:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:08,543 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 03:49:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 03:49:08,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:08,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:08,544 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-08 03:49:08,544 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-08 03:49:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:08,545 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 03:49:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 03:49:08,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:08,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:08,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:08,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:08,546 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-08 03:49:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 03:49:08,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 03:49:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:08,547 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 03:49:08,547 INFO L479 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-08 03:49:08,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 03:49:08,562 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-08 03:49:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 03:49:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:49:08,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:08,563 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:08,579 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-08 03:49:08,764 WARN L460 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-08 03:49:08,764 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-08 03:49:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:08,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575178277] [2022-04-08 03:49:08,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:08,779 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:49:08,779 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-08 03:49:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:08,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607587252] [2022-04-08 03:49:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:08,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:08,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {844#(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); {834#true} is VALID [2022-04-08 03:49:08,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 03:49:08,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 03:49:08,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:08,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#(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); {834#true} is VALID [2022-04-08 03:49:08,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 03:49:08,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 03:49:08,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret5 := main(); {834#true} is VALID [2022-04-08 03:49:08,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} ~x~0 := 0;~y~0 := 1; {839#(= main_~x~0 0)} is VALID [2022-04-08 03:49:08,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {839#(= 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; {840#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 03:49:08,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#(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; {841#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 03:49:08,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#(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; {842#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 03:49:08,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(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; {843#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:49:08,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {843#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {835#false} is VALID [2022-04-08 03:49:08,897 INFO L272 TraceCheckUtils]: 11: Hoare triple {835#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {835#false} is VALID [2022-04-08 03:49:08,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {835#false} ~cond := #in~cond; {835#false} is VALID [2022-04-08 03:49:08,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {835#false} assume 0 == ~cond; {835#false} is VALID [2022-04-08 03:49:08,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-08 03:49:08,898 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-08 03:49:08,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:08,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607587252] [2022-04-08 03:49:08,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607587252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:08,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371424520] [2022-04-08 03:49:08,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:49:08,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:08,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:08,900 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-08 03:49:08,901 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-08 03:49:08,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:49:08,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:08,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 03:49:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:08,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:09,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-08 03:49:09,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#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); {834#true} is VALID [2022-04-08 03:49:09,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 03:49:09,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 03:49:09,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret5 := main(); {834#true} is VALID [2022-04-08 03:49:09,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} ~x~0 := 0;~y~0 := 1; {863#(= main_~y~0 1)} is VALID [2022-04-08 03:49:09,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(= 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; {867#(= main_~y~0 2)} is VALID [2022-04-08 03:49:09,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(= 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; {871#(= main_~y~0 4)} is VALID [2022-04-08 03:49:09,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(= 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; {875#(= main_~y~0 8)} is VALID [2022-04-08 03:49:09,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#(= main_~y~0 8)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {879#(= main_~y~0 16)} is VALID [2022-04-08 03:49:09,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(= main_~y~0 16)} assume !(~x~0 % 4294967296 < 6); {879#(= main_~y~0 16)} is VALID [2022-04-08 03:49:09,055 INFO L272 TraceCheckUtils]: 11: Hoare triple {879#(= main_~y~0 16)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:09,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:09,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-08 03:49:09,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-08 03:49:09,057 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-08 03:49:09,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:09,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-08 03:49:09,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-08 03:49:09,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:09,243 INFO L272 TraceCheckUtils]: 11: Hoare triple {906#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:09,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {906#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:09,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {906#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:09,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {913#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 03:49:09,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(not (= (mod (* main_~y~0 8) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {917#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 03:49:09,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {921#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-08 03:49:09,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} ~x~0 := 0;~y~0 := 1; {925#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} is VALID [2022-04-08 03:49:09,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret5 := main(); {834#true} is VALID [2022-04-08 03:49:09,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 03:49:09,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 03:49:09,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#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); {834#true} is VALID [2022-04-08 03:49:09,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-08 03:49:09,249 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-08 03:49:09,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371424520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:09,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:09,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2022-04-08 03:49:09,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:09,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575178277] [2022-04-08 03:49:09,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575178277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:09,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:09,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:49:09,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850013112] [2022-04-08 03:49:09,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:09,251 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-08 03:49:09,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:09,251 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-08 03:49:09,266 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-08 03:49:09,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:49:09,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:09,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:49:09,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:49:09,268 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-08 03:49:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:09,435 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 03:49:09,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:49:09,435 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-08 03:49:09,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:09,435 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-08 03:49:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 03:49:09,437 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-08 03:49:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 03:49:09,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-08 03:49:09,460 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-08 03:49:09,461 INFO L225 Difference]: With dead ends: 22 [2022-04-08 03:49:09,461 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 03:49:09,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-04-08 03:49:09,462 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:09,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:49:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 03:49:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 03:49:09,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:09,471 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-08 03:49:09,471 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-08 03:49:09,471 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-08 03:49:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:09,472 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 03:49:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 03:49:09,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:09,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:09,473 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-08 03:49:09,473 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-08 03:49:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:09,474 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 03:49:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 03:49:09,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:09,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:09,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:09,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:09,474 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-08 03:49:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 03:49:09,475 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 03:49:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:09,475 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 03:49:09,475 INFO L479 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-08 03:49:09,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 03:49:09,494 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-08 03:49:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 03:49:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:49:09,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:09,498 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:09,523 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-08 03:49:09,720 WARN L460 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-08 03:49:09,721 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-08 03:49:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:09,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011714085] [2022-04-08 03:49:09,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:09,724 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:49:09,724 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-08 03:49:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:09,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838916903] [2022-04-08 03:49:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:09,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:49:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:09,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {1079#(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); {1068#true} is VALID [2022-04-08 03:49:09,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 03:49:09,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 03:49:09,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:49:09,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#(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); {1068#true} is VALID [2022-04-08 03:49:09,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 03:49:09,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 03:49:09,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-08 03:49:09,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1073#(= main_~x~0 0)} is VALID [2022-04-08 03:49:09,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(= 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; {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 03:49:09,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(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; {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 03:49:09,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(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; {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 03:49:09,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(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; {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 03:49:09,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(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; {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-08 03:49:09,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1069#false} is VALID [2022-04-08 03:49:09,900 INFO L272 TraceCheckUtils]: 12: Hoare triple {1069#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {1069#false} is VALID [2022-04-08 03:49:09,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {1069#false} ~cond := #in~cond; {1069#false} is VALID [2022-04-08 03:49:09,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1069#false} assume 0 == ~cond; {1069#false} is VALID [2022-04-08 03:49:09,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-08 03:49:09,901 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-08 03:49:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:49:09,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838916903] [2022-04-08 03:49:09,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838916903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:49:09,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957701968] [2022-04-08 03:49:09,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:49:09,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:49:09,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:49:09,903 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-08 03:49:09,911 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-08 03:49:09,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:49:09,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:49:09,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 03:49:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:49:09,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:49:10,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-08 03:49:10,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#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); {1068#true} is VALID [2022-04-08 03:49:10,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 03:49:10,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 03:49:10,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-08 03:49:10,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1098#(= main_~y~0 1)} is VALID [2022-04-08 03:49:10,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(= 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; {1102#(= main_~y~0 2)} is VALID [2022-04-08 03:49:10,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#(= 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; {1106#(= main_~y~0 4)} is VALID [2022-04-08 03:49:10,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {1106#(= 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; {1110#(= main_~y~0 8)} is VALID [2022-04-08 03:49:10,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#(= main_~y~0 8)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1114#(= main_~y~0 16)} is VALID [2022-04-08 03:49:10,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {1114#(= main_~y~0 16)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1118#(= 32 main_~y~0)} is VALID [2022-04-08 03:49:10,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {1118#(= 32 main_~y~0)} assume !(~x~0 % 4294967296 < 6); {1118#(= 32 main_~y~0)} is VALID [2022-04-08 03:49:10,097 INFO L272 TraceCheckUtils]: 12: Hoare triple {1118#(= 32 main_~y~0)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:10,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:10,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1069#false} is VALID [2022-04-08 03:49:10,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-08 03:49:10,098 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-08 03:49:10,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:49:10,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-08 03:49:10,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1069#false} is VALID [2022-04-08 03:49:10,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:49:10,321 INFO L272 TraceCheckUtils]: 12: Hoare triple {1145#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:49:10,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {1145#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:10,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1145#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 03:49:10,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1152#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 03:49:10,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(not (= (mod (* main_~y~0 8) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1156#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 03:49:10,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1164#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1160#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-08 03:49:10,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {1168#(not (= 64 (mod (* 32 main_~y~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1164#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} is VALID [2022-04-08 03:49:10,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1168#(not (= 64 (mod (* 32 main_~y~0) 4294967296)))} is VALID [2022-04-08 03:49:10,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-08 03:49:10,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 03:49:10,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 03:49:10,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#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); {1068#true} is VALID [2022-04-08 03:49:10,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-08 03:49:10,332 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-08 03:49:10,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957701968] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:49:10,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:49:10,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2022-04-08 03:49:10,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:49:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011714085] [2022-04-08 03:49:10,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011714085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:49:10,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:49:10,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:49:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629542041] [2022-04-08 03:49:10,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:49:10,333 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-08 03:49:10,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:49:10,334 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-08 03:49:10,358 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-08 03:49:10,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:49:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:10,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:49:10,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:49:10,359 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-08 03:49:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:10,602 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 03:49:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:49:10,602 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-08 03:49:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:49:10,603 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-08 03:49:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 03:49:10,604 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-08 03:49:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 03:49:10,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-08 03:49:10,627 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-08 03:49:10,628 INFO L225 Difference]: With dead ends: 23 [2022-04-08 03:49:10,628 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 03:49:10,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-04-08 03:49:10,630 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:49:10,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:49:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 03:49:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 03:49:10,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:49:10,644 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-08 03:49:10,644 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-08 03:49:10,644 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-08 03:49:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:10,645 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 03:49:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 03:49:10,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:10,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:10,645 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-08 03:49:10,646 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-08 03:49:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:49:10,649 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 03:49:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 03:49:10,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:49:10,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:49:10,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:49:10,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:49:10,651 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-08 03:49:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 03:49:10,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 03:49:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:49:10,652 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 03:49:10,652 INFO L479 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-08 03:49:10,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 03:49:10,671 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-08 03:49:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 03:49:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:49:10,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:49:10,671 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:49:10,695 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-08 03:49:10,887 WARN L460 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-08 03:49:10,887 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:49:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:49:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-08 03:49:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:49:10,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977950353] [2022-04-08 03:49:10,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:49:10,890 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 03:49:10,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:49:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-08 03:49:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:49:10,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735800461] [2022-04-08 03:49:10,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:49:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:49:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:49:10,907 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 03:49:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:49:10,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 03:49:10,928 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 03:49:10,929 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 03:49:10,930 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:49:10,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 03:49:10,934 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-08 03:49:10,937 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 03:49:10,953 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 03:49:10,954 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 03:49:10,954 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:49:10,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:49:10 BoogieIcfgContainer [2022-04-08 03:49:10,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:49:10,956 INFO L158 Benchmark]: Toolchain (without parser) took 6367.84ms. Allocated memory is still 181.4MB. Free memory was 133.5MB in the beginning and 84.8MB in the end (delta: 48.8MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. [2022-04-08 03:49:10,956 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:49:10,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.81ms. Allocated memory is still 181.4MB. Free memory was 133.4MB in the beginning and 161.0MB in the end (delta: -27.6MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-08 03:49:10,957 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 181.4MB. Free memory was 161.0MB in the beginning and 159.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 03:49:10,957 INFO L158 Benchmark]: RCFGBuilder took 203.24ms. Allocated memory is still 181.4MB. Free memory was 159.6MB in the beginning and 149.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 03:49:10,957 INFO L158 Benchmark]: TraceAbstraction took 5828.19ms. Allocated memory is still 181.4MB. Free memory was 149.3MB in the beginning and 84.8MB in the end (delta: 64.5MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. [2022-04-08 03:49:10,958 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory was 149.7MB in the beginning and 149.6MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.81ms. Allocated memory is still 181.4MB. Free memory was 133.4MB in the beginning and 161.0MB in the end (delta: -27.6MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 181.4MB. Free memory was 161.0MB in the beginning and 159.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 203.24ms. Allocated memory is still 181.4MB. Free memory was 159.6MB in the beginning and 149.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5828.19ms. Allocated memory is still 181.4MB. Free memory was 149.3MB in the beginning and 84.8MB in the end (delta: 64.5MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L13] unsigned int x = 0; [L14] unsigned int y = 1; [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND FALSE !(x < 6) [L21] CALL __VERIFIER_assert(y != 64) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 83 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-08 03:49:10,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...