/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/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:56:24,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:56:24,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:56:24,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:56:24,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:56:24,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:56:24,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:56:24,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:56:24,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:56:24,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:56:24,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:56:24,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:56:24,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:56:24,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:56:24,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:56:24,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:56:24,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:56:24,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:56:24,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:56:24,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:56:24,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:56:24,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:56:24,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:56:24,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:56:24,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:56:24,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:56:24,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:56:24,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:56:24,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:56:24,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:56:24,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:56:24,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:56:24,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:56:24,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:56:24,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:56:24,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:56:24,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:56:24,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:56:24,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:56:24,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:56:24,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:56:24,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:56:24,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:56:24,942 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:56:24,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:56:24,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:56:24,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:56:24,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:56:24,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:56:24,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:56:24,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:56:24,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:56:24,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:56:24,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:56:24,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:56:24,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:56:24,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:56:24,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:56:24,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:56:24,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:56:24,945 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:56:25,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:56:25,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:56:25,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:56:25,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:56:25,150 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:56:25,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-15 05:56:25,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9411fdf8/a91775d64ad14eea8e90e25947f24db0/FLAGa10bef417 [2022-04-15 05:56:25,581 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:56:25,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-15 05:56:25,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9411fdf8/a91775d64ad14eea8e90e25947f24db0/FLAGa10bef417 [2022-04-15 05:56:25,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9411fdf8/a91775d64ad14eea8e90e25947f24db0 [2022-04-15 05:56:25,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:56:25,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:56:25,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:56:25,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:56:25,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:56:25,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798ba835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25, skipping insertion in model container [2022-04-15 05:56:25,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:56:25,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:56:25,756 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/diamond_1-2.c[373,386] [2022-04-15 05:56:25,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:56:25,772 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:56:25,779 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/diamond_1-2.c[373,386] [2022-04-15 05:56:25,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:56:25,794 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:56:25,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25 WrapperNode [2022-04-15 05:56:25,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:56:25,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:56:25,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:56:25,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:56:25,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:56:25,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:56:25,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:56:25,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:56:25,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (1/1) ... [2022-04-15 05:56:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:56:25,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:25,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:56:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:56:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:56:25,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:56:25,889 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:56:25,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:56:25,889 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:56:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:56:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:56:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:56:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:56:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 05:56:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:56:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:56:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:56:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:56:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:56:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:56:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:56:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:56:25,940 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:56:25,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:56:26,046 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:56:26,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:56:26,050 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:56:26,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:56:26 BoogieIcfgContainer [2022-04-15 05:56:26,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:56:26,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:56:26,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:56:26,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:56:26,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:56:25" (1/3) ... [2022-04-15 05:56:26,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366cfeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:56:26, skipping insertion in model container [2022-04-15 05:56:26,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:25" (2/3) ... [2022-04-15 05:56:26,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366cfeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:56:26, skipping insertion in model container [2022-04-15 05:56:26,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:56:26" (3/3) ... [2022-04-15 05:56:26,071 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2022-04-15 05:56:26,074 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:56:26,074 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:56:26,118 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:56:26,123 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:56:26,123 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:56:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:56:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:56:26,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:26,144 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:26,144 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-15 05:56:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:26,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1880029980] [2022-04-15 05:56:26,162 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:56:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 2 times [2022-04-15 05:56:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:26,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617667995] [2022-04-15 05:56:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:26,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 05:56:26,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 05:56:26,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-15 05:56:26,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:26,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 05:56:26,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 05:56:26,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-15 05:56:26,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-15 05:56:26,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-15 05:56:26,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 05:56:26,275 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-15 05:56:26,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 05:56:26,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 05:56:26,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 05:56:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:26,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617667995] [2022-04-15 05:56:26,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617667995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:26,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:26,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:56:26,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:26,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1880029980] [2022-04-15 05:56:26,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1880029980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:26,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:26,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:56:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380090260] [2022-04-15 05:56:26,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:26,283 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-15 05:56:26,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:26,286 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-15 05:56:26,299 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-15 05:56:26,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:56:26,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:56:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:56:26,314 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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-15 05:56:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,360 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 05:56:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:56:26,361 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-15 05:56:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:26,362 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-15 05:56:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 05:56:26,366 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-15 05:56:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 05:56:26,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-15 05:56:26,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:26,406 INFO L225 Difference]: With dead ends: 30 [2022-04-15 05:56:26,406 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 05:56:26,408 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:56:26,410 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:26,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 05:56:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 05:56:26,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:26,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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-15 05:56:26,430 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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-15 05:56:26,430 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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-15 05:56:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,435 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 05:56:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 05:56:26,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:26,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:26,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 13 states. [2022-04-15 05:56:26,436 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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 13 states. [2022-04-15 05:56:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,442 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 05:56:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 05:56:26,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:26,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:26,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:26,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 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-15 05:56:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 05:56:26,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 05:56:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:26,448 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 05:56:26,449 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-15 05:56:26,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 05:56:26,466 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-15 05:56:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 05:56:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:56:26,470 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:26,473 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:26,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:56:26,473 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-15 05:56:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:26,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437243272] [2022-04-15 05:56:26,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:56:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 2 times [2022-04-15 05:56:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976423302] [2022-04-15 05:56:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:26,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 05:56:26,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 05:56:26,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-15 05:56:26,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:26,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 05:56:26,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 05:56:26,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-15 05:56:26,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret6 := main(); {142#true} is VALID [2022-04-15 05:56:26,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {147#(= main_~x~0 0)} is VALID [2022-04-15 05:56:26,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {143#false} is VALID [2022-04-15 05:56:26,595 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-15 05:56:26,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-15 05:56:26,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-15 05:56:26,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-15 05:56:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:26,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:26,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976423302] [2022-04-15 05:56:26,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976423302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:26,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:26,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:26,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:26,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437243272] [2022-04-15 05:56:26,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437243272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:26,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:26,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857543762] [2022-04-15 05:56:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:26,597 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-15 05:56:26,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:26,598 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-15 05:56:26,613 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-15 05:56:26,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:56:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:56:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:56:26,615 INFO L87 Difference]: Start difference. First operand 13 states and 14 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-15 05:56:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,679 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 05:56:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:56:26,679 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-15 05:56:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:26,680 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-15 05:56:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 05:56:26,681 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-15 05:56:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 05:56:26,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-15 05:56:26,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:26,716 INFO L225 Difference]: With dead ends: 20 [2022-04-15 05:56:26,717 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 05:56:26,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:56:26,723 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:26,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 05:56:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-15 05:56:26,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:26,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-15 05:56:26,730 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-15 05:56:26,731 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-15 05:56:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,733 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 05:56:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 05:56:26,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:26,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:26,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-15 05:56:26,734 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-15 05:56:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,736 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 05:56:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 05:56:26,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:26,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:26,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:26,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-15 05:56:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 05:56:26,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 05:56:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:26,739 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 05:56:26,739 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-15 05:56:26,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 05:56:26,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:56:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 05:56:26,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:26,753 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:26,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:56:26,754 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-15 05:56:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:26,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425934930] [2022-04-15 05:56:27,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:27,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:56:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash -230057778, now seen corresponding path program 1 times [2022-04-15 05:56:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:27,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548041481] [2022-04-15 05:56:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:27,313 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_1.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_1.0) main_~x~0_5) 4294967296)) 99) 0)) [2022-04-15 05:56:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:56:27,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321794948] [2022-04-15 05:56:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:27,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:27,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:27,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:27,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:56:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:27,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:56:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:27,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:56:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 2 times [2022-04-15 05:56:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:27,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911901162] [2022-04-15 05:56:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-15 05:56:27,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 05:56:27,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 05:56:27,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:27,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-15 05:56:27,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 05:56:27,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 05:56:27,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-15 05:56:27,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-15 05:56:27,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {256#(= main_~x~0 0)} is VALID [2022-04-15 05:56:27,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {257#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:27,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-15 05:56:27,551 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-15 05:56:27,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-15 05:56:27,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-15 05:56:27,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-15 05:56:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:27,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911901162] [2022-04-15 05:56:27,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911901162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:27,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990002682] [2022-04-15 05:56:27,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:27,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:27,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:27,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:27,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:56:27,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:27,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:27,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:56:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:27,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-15 05:56:27,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-15 05:56:27,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 05:56:27,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 05:56:27,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-15 05:56:27,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-15 05:56:27,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {256#(= main_~x~0 0)} is VALID [2022-04-15 05:56:27,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {283#(= (+ (- 2) main_~x~0) 0)} is VALID [2022-04-15 05:56:27,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#(= (+ (- 2) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-15 05:56:27,693 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-15 05:56:27,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-15 05:56:27,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-15 05:56:27,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-15 05:56:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:27,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:27,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-15 05:56:27,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-15 05:56:27,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-15 05:56:27,754 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-15 05:56:27,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-15 05:56:27,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {311#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-15 05:56:27,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-15 05:56:27,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-15 05:56:27,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-15 05:56:27,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 05:56:27,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 05:56:27,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-15 05:56:27,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-15 05:56:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:27,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990002682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:27,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:27,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:56:27,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:27,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425934930] [2022-04-15 05:56:27,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425934930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:27,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:27,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:56:27,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555633492] [2022-04-15 05:56:27,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:27,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-15 05:56:27,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:27,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-15 05:56:27,769 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-15 05:56:27,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:56:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:27,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:56:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:56:27,770 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-15 05:56:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:27,847 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-15 05:56:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:56:27,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-15 05:56:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-15 05:56:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-15 05:56:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-15 05:56:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-15 05:56:27,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-15 05:56:27,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:27,892 INFO L225 Difference]: With dead ends: 22 [2022-04-15 05:56:27,892 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 05:56:27,892 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:56:27,894 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:27,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 05:56:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 05:56:27,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:27,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-15 05:56:27,909 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-15 05:56:27,909 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-15 05:56:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:27,912 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 05:56:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 05:56:27,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:27,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:27,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 17 states. [2022-04-15 05:56:27,913 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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 17 states. [2022-04-15 05:56:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:27,914 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 05:56:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 05:56:27,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:27,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:27,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:27,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-15 05:56:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 05:56:27,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-15 05:56:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:27,916 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 05:56:27,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-15 05:56:27,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 05:56:27,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 05:56:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:56:27,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:27,943 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:27,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 05:56:28,165 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-15 05:56:28,360 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,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:28,360 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 3 times [2022-04-15 05:56:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:28,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1862693575] [2022-04-15 05:56:28,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:28,640 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:56:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash -170952434, now seen corresponding path program 1 times [2022-04-15 05:56:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968994284] [2022-04-15 05:56:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:28,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:28,652 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_2.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_2.0)) 4294967296)) 99) 0)) [2022-04-15 05:56:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:56:28,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738969994] [2022-04-15 05:56:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:28,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:28,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:28,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 05:56:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:28,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:56:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:28,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:56:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 4 times [2022-04-15 05:56:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:28,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701315022] [2022-04-15 05:56:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:28,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#(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(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 05:56:28,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 05:56:28,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-15 05:56:28,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:28,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#(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(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 05:56:28,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 05:56:28,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-15 05:56:28,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-15 05:56:28,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {458#(= main_~x~0 0)} is VALID [2022-04-15 05:56:28,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {458#(= main_~x~0 0)} is VALID [2022-04-15 05:56:28,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:28,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:28,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {460#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:56:28,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {454#false} is VALID [2022-04-15 05:56:28,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {454#false} is VALID [2022-04-15 05:56:28,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-15 05:56:28,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-15 05:56:28,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-15 05:56:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:28,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701315022] [2022-04-15 05:56:28,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701315022] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:28,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313827330] [2022-04-15 05:56:28,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:28,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:28,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:28,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:28,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 05:56:28,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:28,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:28,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:56:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:28,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:29,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-15 05:56:29,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#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(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 05:56:29,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 05:56:29,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-15 05:56:29,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-15 05:56:29,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {458#(= main_~x~0 0)} is VALID [2022-04-15 05:56:29,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {458#(= main_~x~0 0)} is VALID [2022-04-15 05:56:29,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:29,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:29,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {492#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:56:29,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {492#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {454#false} is VALID [2022-04-15 05:56:29,020 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {454#false} is VALID [2022-04-15 05:56:29,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-15 05:56:29,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-15 05:56:29,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-15 05:56:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:29,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:29,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-15 05:56:29,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-15 05:56:29,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-15 05:56:29,114 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {454#false} is VALID [2022-04-15 05:56:29,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {454#false} is VALID [2022-04-15 05:56:29,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {520#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-15 05:56:29,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-15 05:56:29,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-15 05:56:29,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-15 05:56:29,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-15 05:56:29,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-15 05:56:29,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-15 05:56:29,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 05:56:29,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#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(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 05:56:29,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-15 05:56:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:29,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313827330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:29,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:29,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 05:56:29,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1862693575] [2022-04-15 05:56:29,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1862693575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:29,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:29,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:56:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067494982] [2022-04-15 05:56:29,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:29,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:56:29,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:29,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:29,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:56:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:56:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:56:29,132 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:29,243 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 05:56:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:56:29,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:56:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 05:56:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 05:56:29,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-15 05:56:29,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:29,268 INFO L225 Difference]: With dead ends: 25 [2022-04-15 05:56:29,269 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 05:56:29,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:56:29,269 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:29,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 05:56:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-15 05:56:29,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:29,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,279 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,279 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:29,281 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 05:56:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 05:56:29,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:29,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:29,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 05:56:29,281 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 05:56:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:29,282 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 05:56:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 05:56:29,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:29,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:29,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:29,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-15 05:56:29,283 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-15 05:56:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:29,283 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-15 05:56:29,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:29,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-15 05:56:29,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 05:56:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:56:29,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:29,306 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:29,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:29,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:29,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:29,723 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 1 times [2022-04-15 05:56:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:29,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655126375] [2022-04-15 05:56:30,117 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:56:32,352 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:56:33,149 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:33,150 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:56:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2055943693, now seen corresponding path program 1 times [2022-04-15 05:56:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511833681] [2022-04-15 05:56:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:33,172 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_4.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_4.0) main_~x~0_6) 4294967296)) 99) 0)) [2022-04-15 05:56:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:56:33,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728020198] [2022-04-15 05:56:33,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:33,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:33,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:33,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:33,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 05:56:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:33,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:56:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:33,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:56:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 2 times [2022-04-15 05:56:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:33,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987002176] [2022-04-15 05:56:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:33,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {693#(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(14, 2);call #Ultimate.allocInit(12, 3); {687#true} is VALID [2022-04-15 05:56:33,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-15 05:56:33,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {687#true} {687#true} #42#return; {687#true} is VALID [2022-04-15 05:56:33,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:33,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#(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(14, 2);call #Ultimate.allocInit(12, 3); {687#true} is VALID [2022-04-15 05:56:33,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-15 05:56:33,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #42#return; {687#true} is VALID [2022-04-15 05:56:33,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret6 := main(); {687#true} is VALID [2022-04-15 05:56:33,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {687#true} is VALID [2022-04-15 05:56:33,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {687#true} assume !!(~x~0 % 4294967296 < 99); {687#true} is VALID [2022-04-15 05:56:33,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {687#true} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-15 05:56:33,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 99); {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-15 05:56:33,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {688#false} is VALID [2022-04-15 05:56:33,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {688#false} assume !(~x~0 % 4294967296 < 99); {688#false} is VALID [2022-04-15 05:56:33,270 INFO L272 TraceCheckUtils]: 11: Hoare triple {688#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {688#false} is VALID [2022-04-15 05:56:33,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {688#false} ~cond := #in~cond; {688#false} is VALID [2022-04-15 05:56:33,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {688#false} assume 0 == ~cond; {688#false} is VALID [2022-04-15 05:56:33,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#false} assume !false; {688#false} is VALID [2022-04-15 05:56:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:33,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:33,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987002176] [2022-04-15 05:56:33,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987002176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:33,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:33,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:33,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:33,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655126375] [2022-04-15 05:56:33,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655126375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:33,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:33,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651872280] [2022-04-15 05:56:33,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:56:33,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:33,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:33,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:56:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:56:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:56:33,282 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,330 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 05:56:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:56:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:56:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-15 05:56:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-15 05:56:33,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-15 05:56:33,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:33,352 INFO L225 Difference]: With dead ends: 29 [2022-04-15 05:56:33,352 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 05:56:33,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:56:33,353 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:33,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 05:56:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 05:56:33,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:33,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,366 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,366 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,368 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 05:56:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 05:56:33,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:33,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:33,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:56:33,368 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:56:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,370 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 05:56:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 05:56:33,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:33,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:33,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:33,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-15 05:56:33,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2022-04-15 05:56:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:33,371 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-15 05:56:33,371 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-15 05:56:33,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 05:56:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:56:33,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:33,394 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:33,427 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-15 05:56:33,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:33,611 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2035794270, now seen corresponding path program 1 times [2022-04-15 05:56:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:33,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1824123515] [2022-04-15 05:56:35,512 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:56:35,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:56:35,695 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:56:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 6363598, now seen corresponding path program 1 times [2022-04-15 05:56:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:35,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598652702] [2022-04-15 05:56:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:35,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:56:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:35,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:56:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2035794270, now seen corresponding path program 2 times [2022-04-15 05:56:35,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:35,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205830757] [2022-04-15 05:56:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:35,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {851#(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(14, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-15 05:56:35,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-15 05:56:35,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-15 05:56:35,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:35,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#(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(14, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-15 05:56:35,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-15 05:56:35,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-15 05:56:35,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret6 := main(); {843#true} is VALID [2022-04-15 05:56:35,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {848#(= main_~x~0 0)} is VALID [2022-04-15 05:56:35,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {848#(= main_~x~0 0)} is VALID [2022-04-15 05:56:35,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 05:56:35,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 05:56:35,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:35,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {844#false} is VALID [2022-04-15 05:56:35,811 INFO L272 TraceCheckUtils]: 11: Hoare triple {844#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-15 05:56:35,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-15 05:56:35,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-15 05:56:35,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-15 05:56:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:35,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205830757] [2022-04-15 05:56:35,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205830757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988632974] [2022-04-15 05:56:35,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:35,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:35,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:35,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 05:56:35,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:35,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:35,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:56:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:35,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:35,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-15 05:56:35,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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(14, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-15 05:56:35,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-15 05:56:35,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-15 05:56:35,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret6 := main(); {843#true} is VALID [2022-04-15 05:56:35,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {848#(= main_~x~0 0)} is VALID [2022-04-15 05:56:35,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {848#(= main_~x~0 0)} is VALID [2022-04-15 05:56:35,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 05:56:35,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 05:56:35,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {882#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:35,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {844#false} is VALID [2022-04-15 05:56:35,986 INFO L272 TraceCheckUtils]: 11: Hoare triple {844#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-15 05:56:35,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-15 05:56:35,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-15 05:56:35,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-15 05:56:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:35,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:36,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-15 05:56:36,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-15 05:56:36,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-15 05:56:36,059 INFO L272 TraceCheckUtils]: 11: Hoare triple {844#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-15 05:56:36,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {910#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {844#false} is VALID [2022-04-15 05:56:36,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {914#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {910#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-15 05:56:36,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {914#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {914#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-15 05:56:36,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {914#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-15 05:56:36,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {921#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {921#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-15 05:56:36,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {921#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-15 05:56:36,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret6 := main(); {843#true} is VALID [2022-04-15 05:56:36,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-15 05:56:36,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-15 05:56:36,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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(14, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-15 05:56:36,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-15 05:56:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:36,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988632974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:36,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:36,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 05:56:36,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:36,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1824123515] [2022-04-15 05:56:36,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1824123515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:36,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:36,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:56:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758628546] [2022-04-15 05:56:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:36,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:56:36,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:36,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:36,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:56:36,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:36,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:56:36,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:56:36,077 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:36,194 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 05:56:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:56:36,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:56:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-15 05:56:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-15 05:56:36,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-15 05:56:36,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:36,218 INFO L225 Difference]: With dead ends: 30 [2022-04-15 05:56:36,218 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 05:56:36,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:56:36,219 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:36,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 05:56:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-15 05:56:36,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:36,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,240 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,240 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:36,241 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 05:56:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 05:56:36,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:36,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:36,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 05:56:36,243 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 05:56:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:36,246 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 05:56:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 05:56:36,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:36,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:36,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:36,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 05:56:36,247 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-15 05:56:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:36,247 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 05:56:36,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:36,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 05:56:36,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 05:56:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:56:36,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:36,271 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:36,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:36,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:36,476 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 5 times [2022-04-15 05:56:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:36,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853026883] [2022-04-15 05:56:36,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:36,758 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:56:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 65468942, now seen corresponding path program 1 times [2022-04-15 05:56:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:36,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277352156] [2022-04-15 05:56:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:36,765 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_6.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_6.0)) 4294967296)) 99) 0)) [2022-04-15 05:56:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:56:36,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607889259] [2022-04-15 05:56:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:36,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:36,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:36,774 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:36,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 05:56:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:36,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:56:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:36,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:56:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 6 times [2022-04-15 05:56:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:36,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130877241] [2022-04-15 05:56:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:36,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {1116#(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(14, 2);call #Ultimate.allocInit(12, 3); {1107#true} is VALID [2022-04-15 05:56:36,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-15 05:56:36,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-15 05:56:36,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1107#true} call ULTIMATE.init(); {1116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:36,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#(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(14, 2);call #Ultimate.allocInit(12, 3); {1107#true} is VALID [2022-04-15 05:56:36,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-15 05:56:36,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-15 05:56:36,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1107#true} call #t~ret6 := main(); {1107#true} is VALID [2022-04-15 05:56:36,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1107#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1112#(= main_~x~0 0)} is VALID [2022-04-15 05:56:36,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1112#(= main_~x~0 0)} is VALID [2022-04-15 05:56:36,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:36,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:36,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1114#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:56:36,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {1114#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1114#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:56:36,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {1114#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1115#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 05:56:36,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 99); {1108#false} is VALID [2022-04-15 05:56:36,918 INFO L272 TraceCheckUtils]: 13: Hoare triple {1108#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1108#false} is VALID [2022-04-15 05:56:36,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {1108#false} ~cond := #in~cond; {1108#false} is VALID [2022-04-15 05:56:36,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {1108#false} assume 0 == ~cond; {1108#false} is VALID [2022-04-15 05:56:36,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {1108#false} assume !false; {1108#false} is VALID [2022-04-15 05:56:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:36,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:36,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130877241] [2022-04-15 05:56:36,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130877241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:36,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555377455] [2022-04-15 05:56:36,919 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:36,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:36,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:56:36,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 05:56:36,947 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 05:56:36,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:36,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 05:56:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:36,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:37,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1107#true} call ULTIMATE.init(); {1107#true} is VALID [2022-04-15 05:56:37,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1107#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(14, 2);call #Ultimate.allocInit(12, 3); {1107#true} is VALID [2022-04-15 05:56:37,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-15 05:56:37,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-15 05:56:37,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {1107#true} call #t~ret6 := main(); {1107#true} is VALID [2022-04-15 05:56:37,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {1107#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1112#(= main_~x~0 0)} is VALID [2022-04-15 05:56:37,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1112#(= main_~x~0 0)} is VALID [2022-04-15 05:56:37,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:37,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:56:37,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~0))} is VALID [2022-04-15 05:56:37,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~0))} is VALID [2022-04-15 05:56:37,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1154#(and (<= 6 main_~x~0) (not (= (mod main_~y~0 2) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 05:56:37,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (<= 6 main_~x~0) (not (= (mod main_~y~0 2) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 99); {1108#false} is VALID [2022-04-15 05:56:37,073 INFO L272 TraceCheckUtils]: 13: Hoare triple {1108#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1108#false} is VALID [2022-04-15 05:56:37,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {1108#false} ~cond := #in~cond; {1108#false} is VALID [2022-04-15 05:56:37,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {1108#false} assume 0 == ~cond; {1108#false} is VALID [2022-04-15 05:56:37,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1108#false} assume !false; {1108#false} is VALID [2022-04-15 05:56:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:37,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:37,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1108#false} assume !false; {1108#false} is VALID [2022-04-15 05:56:37,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1108#false} is VALID [2022-04-15 05:56:37,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1177#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1173#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:56:37,506 INFO L272 TraceCheckUtils]: 13: Hoare triple {1181#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1177#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:37,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {1185#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {1181#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-15 05:56:37,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1185#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-15 05:56:37,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-15 05:56:37,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-15 05:56:37,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 99); {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-15 05:56:37,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-15 05:56:37,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 99); {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-15 05:56:37,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {1107#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-15 05:56:37,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {1107#true} call #t~ret6 := main(); {1107#true} is VALID [2022-04-15 05:56:37,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-15 05:56:37,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-15 05:56:37,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1107#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(14, 2);call #Ultimate.allocInit(12, 3); {1107#true} is VALID [2022-04-15 05:56:37,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1107#true} call ULTIMATE.init(); {1107#true} is VALID [2022-04-15 05:56:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:37,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555377455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:37,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:37,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 16 [2022-04-15 05:56:37,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:37,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853026883] [2022-04-15 05:56:37,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853026883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:37,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:37,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:56:37,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595036898] [2022-04-15 05:56:37,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:37,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:56:37,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:37,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:37,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:56:37,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:37,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:56:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:56:37,526 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:37,701 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 05:56:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:56:37,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:56:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 05:56:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 05:56:37,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 05:56:37,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:37,726 INFO L225 Difference]: With dead ends: 34 [2022-04-15 05:56:37,726 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 05:56:37,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:56:37,727 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:37,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 28 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 05:56:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-15 05:56:37,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:37,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,748 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,748 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:37,749 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 05:56:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 05:56:37,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:37,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:37,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 05:56:37,750 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 05:56:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:37,751 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 05:56:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 05:56:37,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:37,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:37,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:37,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-04-15 05:56:37,752 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2022-04-15 05:56:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:37,752 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-04-15 05:56:37,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 30 transitions. [2022-04-15 05:56:37,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 05:56:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:56:37,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:37,780 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:37,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:37,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:38,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:38,195 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1539234595, now seen corresponding path program 3 times [2022-04-15 05:56:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1924465904] [2022-04-15 05:56:38,615 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:56:38,803 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:38,805 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:56:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1860040717, now seen corresponding path program 1 times [2022-04-15 05:56:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559925580] [2022-04-15 05:56:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:38,817 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_8.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.0)) 4294967296)) 99) 0)) [2022-04-15 05:56:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:38,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:56:38,826 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_8.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.1)) 4294967296)) 99) 0)) [2022-04-15 05:56:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:56:38,847 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Modelproduction for quantifier theory not implemented. [2022-04-15 05:56:38,847 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 05:56:38,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 05:56:38,847 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Modelproduction for quantifier theory not implemented. at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1144) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1009) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:439) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:413) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:425) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:357) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:289) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 05:56:38,850 INFO L158 Benchmark]: Toolchain (without parser) took 13249.19ms. Allocated memory was 185.6MB in the beginning and 225.4MB in the end (delta: 39.8MB). Free memory was 133.8MB in the beginning and 113.5MB in the end (delta: 20.3MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2022-04-15 05:56:38,850 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:56:38,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.23ms. Allocated memory is still 185.6MB. Free memory was 133.7MB in the beginning and 161.3MB in the end (delta: -27.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 05:56:38,850 INFO L158 Benchmark]: Boogie Preprocessor took 38.15ms. Allocated memory is still 185.6MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:56:38,851 INFO L158 Benchmark]: RCFGBuilder took 217.57ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 149.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 05:56:38,851 INFO L158 Benchmark]: TraceAbstraction took 12796.94ms. Allocated memory was 185.6MB in the beginning and 225.4MB in the end (delta: 39.8MB). Free memory was 149.0MB in the beginning and 113.5MB in the end (delta: 35.4MB). Peak memory consumption was 76.6MB. Max. memory is 8.0GB. [2022-04-15 05:56:38,852 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 185.6MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.23ms. Allocated memory is still 185.6MB. Free memory was 133.7MB in the beginning and 161.3MB in the end (delta: -27.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.15ms. Allocated memory is still 185.6MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 217.57ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 149.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 12796.94ms. Allocated memory was 185.6MB in the beginning and 225.4MB in the end (delta: 39.8MB). Free memory was 149.0MB in the beginning and 113.5MB in the end (delta: 35.4MB). Peak memory consumption was 76.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Modelproduction for quantifier theory not implemented. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Modelproduction for quantifier theory not implemented.: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:106) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 05:56:38,863 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...