/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:17:13,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:17:13,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:17:13,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:17:13,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:17:13,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:17:13,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:17:13,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:17:13,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:17:13,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:17:13,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:17:13,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:17:13,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:17:13,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:17:13,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:17:13,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:17:13,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:17:13,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:17:13,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:17:13,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:17:13,935 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:17:13,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:17:13,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:17:13,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:17:13,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:17:13,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:17:13,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:17:13,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:17:13,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:17:13,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:17:13,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:17:13,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:17:13,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:17:13,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:17:13,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:17:13,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:17:13,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:17:13,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:17:13,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:17:13,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:17:13,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:17:13,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:17:13,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:17:13,981 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:17:13,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:17:13,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:17:13,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:17:13,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:17:13,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:17:13,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:17:13,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:17:13,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:17:13,984 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:17:13,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:17:13,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:17:13,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:17:13,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:17:13,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:17:13,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:13,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:17:13,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:17:13,985 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:17:13,986 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:17:13,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:17:13,986 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:17:13,986 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:17:14,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:17:14,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:17:14,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:17:14,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:17:14,375 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:17:14,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2022-04-15 12:17:14,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bba039b/26b76fdf019445bcbb1bb78abbdfefdc/FLAG28fea82dc [2022-04-15 12:17:15,068 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:17:15,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2022-04-15 12:17:15,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bba039b/26b76fdf019445bcbb1bb78abbdfefdc/FLAG28fea82dc [2022-04-15 12:17:15,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bba039b/26b76fdf019445bcbb1bb78abbdfefdc [2022-04-15 12:17:15,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:17:15,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:17:15,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:15,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:17:15,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:17:15,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1975fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15, skipping insertion in model container [2022-04-15 12:17:15,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:17:15,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:17:15,790 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/nested_1-2.c[322,335] [2022-04-15 12:17:15,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:15,837 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:17:15,855 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/nested_1-2.c[322,335] [2022-04-15 12:17:15,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:15,874 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:17:15,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15 WrapperNode [2022-04-15 12:17:15,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:15,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:17:15,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:17:15,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:17:15,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:17:15,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:17:15,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:17:15,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:17:15,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (1/1) ... [2022-04-15 12:17:15,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:15,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:15,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:17:16,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:17:16,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:17:16,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:17:16,080 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:17:16,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:17:16,081 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:17:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:17:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:17:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:17:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:17:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:17:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:17:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:17:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:17:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:17:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:17:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:17:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:17:16,189 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:17:16,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:17:16,371 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:17:16,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:17:16,377 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:17:16,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:16 BoogieIcfgContainer [2022-04-15 12:17:16,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:17:16,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:17:16,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:17:16,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:17:16,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:17:15" (1/3) ... [2022-04-15 12:17:16,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b704016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:16, skipping insertion in model container [2022-04-15 12:17:16,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:15" (2/3) ... [2022-04-15 12:17:16,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b704016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:16, skipping insertion in model container [2022-04-15 12:17:16,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:16" (3/3) ... [2022-04-15 12:17:16,394 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2022-04-15 12:17:16,399 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:17:16,399 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:17:16,464 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:17:16,473 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:17:16,473 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:17:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:17:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:17:16,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:16,499 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:16,516 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:16,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:16,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2021311625, now seen corresponding path program 1 times [2022-04-15 12:17:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:16,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711342791] [2022-04-15 12:17:16,553 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:16,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2021311625, now seen corresponding path program 2 times [2022-04-15 12:17:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:16,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136534160] [2022-04-15 12:17:16,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:16,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:16,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 12:17:16,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:17:17,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 12:17:17,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:17,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 12:17:17,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:17:17,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 12:17:17,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-15 12:17:17,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 0; {28#(= main_~x~0 0)} is VALID [2022-04-15 12:17:17,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {24#false} is VALID [2022-04-15 12:17:17,020 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-15 12:17:17,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 12:17:17,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 12:17:17,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 12:17:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:17,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:17,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136534160] [2022-04-15 12:17:17,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136534160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:17,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:17,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:17,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:17,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [711342791] [2022-04-15 12:17:17,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [711342791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:17,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:17,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121634819] [2022-04-15 12:17:17,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:17,031 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 12:17:17,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:17,068 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 12:17:17,111 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 12:17:17,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:17:17,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:17:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:17:17,151 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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 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 12:17:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:17,362 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-04-15 12:17:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:17:17,363 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 12:17:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:17,364 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 12:17:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 12:17:17,379 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 12:17:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 12:17:17,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 12:17:17,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:17,476 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:17:17,476 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:17:17,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:17:17,484 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:17,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:17:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-04-15 12:17:17,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:17,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:17,540 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:17,540 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:17,549 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:17:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:17,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:17,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:17,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:17:17,551 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:17:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:17,553 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:17:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:17,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:17,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:17,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:17,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:17:17,557 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 12:17:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:17,557 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:17:17,558 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 12:17:17,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:17:17,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:17:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:17:17,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:17,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:17,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:17:17,600 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2037585725, now seen corresponding path program 1 times [2022-04-15 12:17:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:17,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1882384006] [2022-04-15 12:17:17,871 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash -645021174, now seen corresponding path program 1 times [2022-04-15 12:17:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:17,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733613488] [2022-04-15 12:17:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(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(13, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-15 12:17:18,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-15 12:17:18,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} #47#return; {172#true} is VALID [2022-04-15 12:17:18,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(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(13, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-15 12:17:18,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-15 12:17:18,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} #47#return; {172#true} is VALID [2022-04-15 12:17:18,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} call #t~ret6 := main(); {172#true} is VALID [2022-04-15 12:17:18,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} ~x~0 := 0;~y~0 := 0; {177#(= main_~x~0 0)} is VALID [2022-04-15 12:17:18,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {177#(= main_~x~0 0)} [53] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (not (< (mod v_main_~y~0_Out_2 4294967296) 10)) (= |v_main_#t~post5_Out_2| 0) (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 268435455) (= v_main_~y~0_Out_2 0)) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_#t~post5=|v_main_#t~post5_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post5, main_~y~0] {177#(= main_~x~0 0)} is VALID [2022-04-15 12:17:18,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(= main_~x~0 0)} [52] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-15 12:17:18,071 INFO L272 TraceCheckUtils]: 8: Hoare triple {173#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {173#false} is VALID [2022-04-15 12:17:18,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-15 12:17:18,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-15 12:17:18,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-15 12:17:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:18,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733613488] [2022-04-15 12:17:18,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733613488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:18,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:18,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:18,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:18,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1882384006] [2022-04-15 12:17:18,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1882384006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:18,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:18,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9920553] [2022-04-15 12:17:18,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:18,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:17:18,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:18,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,123 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 12:17:18,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:17:18,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:17:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:17:18,124 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:18,252 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 12:17:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:18,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:17:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 12:17:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 12:17:18,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-15 12:17:18,315 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 12:17:18,317 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:17:18,317 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:17:18,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:17:18,321 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 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 12:17:18,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:17:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-15 12:17:18,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:18,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,346 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,347 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:18,348 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:17:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:17:18,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:18,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:18,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:17:18,350 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:17:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:18,353 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:17:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:17:18,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:18,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:18,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:18,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 12:17:18,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-15 12:17:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:18,355 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 12:17:18,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:18,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 12:17:18,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:17:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:17:18,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:18,375 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:18,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:17:18,376 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:18,377 INFO L85 PathProgramCache]: Analyzing trace with hash -183414982, now seen corresponding path program 1 times [2022-04-15 12:17:18,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:18,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708653852] [2022-04-15 12:17:18,685 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -585915830, now seen corresponding path program 1 times [2022-04-15 12:17:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:18,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685706755] [2022-04-15 12:17:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:18,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:18,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash -183414982, now seen corresponding path program 2 times [2022-04-15 12:17:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:18,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863387412] [2022-04-15 12:17:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:18,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:18,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(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(13, 2);call #Ultimate.allocInit(12, 3); {306#true} is VALID [2022-04-15 12:17:18,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2022-04-15 12:17:18,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #47#return; {306#true} is VALID [2022-04-15 12:17:18,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:18,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(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(13, 2);call #Ultimate.allocInit(12, 3); {306#true} is VALID [2022-04-15 12:17:18,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2022-04-15 12:17:18,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #47#return; {306#true} is VALID [2022-04-15 12:17:18,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret6 := main(); {306#true} is VALID [2022-04-15 12:17:18,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0;~y~0 := 0; {306#true} is VALID [2022-04-15 12:17:18,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {306#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {311#(= main_~y~0 0)} is VALID [2022-04-15 12:17:18,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {311#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {312#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} is VALID [2022-04-15 12:17:18,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#(and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 < 10); {307#false} is VALID [2022-04-15 12:17:18,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {307#false} is VALID [2022-04-15 12:17:18,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#false} assume !(~x~0 % 4294967296 < 268435455); {307#false} is VALID [2022-04-15 12:17:18,910 INFO L272 TraceCheckUtils]: 11: Hoare triple {307#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {307#false} is VALID [2022-04-15 12:17:18,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-15 12:17:18,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-15 12:17:18,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-15 12:17:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:18,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863387412] [2022-04-15 12:17:18,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863387412] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:18,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819255414] [2022-04-15 12:17:18,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:18,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:18,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:18,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:18,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:17:18,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:18,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:18,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:17:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:18,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:19,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2022-04-15 12:17:19,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#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(13, 2);call #Ultimate.allocInit(12, 3); {306#true} is VALID [2022-04-15 12:17:19,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2022-04-15 12:17:19,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #47#return; {306#true} is VALID [2022-04-15 12:17:19,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret6 := main(); {306#true} is VALID [2022-04-15 12:17:19,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0;~y~0 := 0; {332#(= main_~x~0 0)} is VALID [2022-04-15 12:17:19,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {336#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 12:17:19,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {336#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {332#(= main_~x~0 0)} is VALID [2022-04-15 12:17:19,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {332#(= main_~x~0 0)} is VALID [2022-04-15 12:17:19,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {346#(= main_~x~0 1)} is VALID [2022-04-15 12:17:19,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {346#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 268435455); {307#false} is VALID [2022-04-15 12:17:19,036 INFO L272 TraceCheckUtils]: 11: Hoare triple {307#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {307#false} is VALID [2022-04-15 12:17:19,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-15 12:17:19,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-15 12:17:19,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-15 12:17:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:19,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:19,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-15 12:17:19,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-15 12:17:19,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-15 12:17:19,123 INFO L272 TraceCheckUtils]: 11: Hoare triple {307#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {307#false} is VALID [2022-04-15 12:17:19,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {374#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {307#false} is VALID [2022-04-15 12:17:19,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {374#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:19,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-15 12:17:19,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-15 12:17:19,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-15 12:17:19,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0;~y~0 := 0; {378#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-15 12:17:19,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret6 := main(); {306#true} is VALID [2022-04-15 12:17:19,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #47#return; {306#true} is VALID [2022-04-15 12:17:19,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2022-04-15 12:17:19,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#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(13, 2);call #Ultimate.allocInit(12, 3); {306#true} is VALID [2022-04-15 12:17:19,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2022-04-15 12:17:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:17:19,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819255414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:19,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:19,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2022-04-15 12:17:19,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:19,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708653852] [2022-04-15 12:17:19,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708653852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:19,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:19,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381453737] [2022-04-15 12:17:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:19,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:17:19,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:19,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:19,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:19,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:17:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:19,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:17:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:17:19,146 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:19,295 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 12:17:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:17:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-15 12:17:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-15 12:17:19,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-04-15 12:17:19,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:19,345 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:17:19,345 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:17:19,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:17:19,367 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:19,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:17:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-15 12:17:19,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:19,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 12:17:19,450 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 12:17:19,451 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 12:17:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:19,453 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 12:17:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:17:19,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:19,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:19,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:17:19,454 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:17:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:19,456 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-15 12:17:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:17:19,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:19,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:19,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:19,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 12:17:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-15 12:17:19,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-04-15 12:17:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:19,461 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-15 12:17:19,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:19,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-15 12:17:19,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:17:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:17:19,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:19,493 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:19,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:19,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:19,715 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1461303203, now seen corresponding path program 3 times [2022-04-15 12:17:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:19,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1500135158] [2022-04-15 12:17:20,024 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash -526810486, now seen corresponding path program 1 times [2022-04-15 12:17:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:20,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836176906] [2022-04-15 12:17:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:20,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {541#(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(13, 2);call #Ultimate.allocInit(12, 3); {535#true} is VALID [2022-04-15 12:17:20,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-15 12:17:20,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #47#return; {535#true} is VALID [2022-04-15 12:17:20,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:20,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#(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(13, 2);call #Ultimate.allocInit(12, 3); {535#true} is VALID [2022-04-15 12:17:20,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#true} assume true; {535#true} is VALID [2022-04-15 12:17:20,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {535#true} {535#true} #47#return; {535#true} is VALID [2022-04-15 12:17:20,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {535#true} call #t~ret6 := main(); {535#true} is VALID [2022-04-15 12:17:20,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {535#true} ~x~0 := 0;~y~0 := 0; {540#(= main_~x~0 0)} is VALID [2022-04-15 12:17:20,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#(= main_~x~0 0)} [57] L16-2-->L16-3_primed: Formula: (or (and (= (* 2 |v_main_#t~post5_Out_6|) 0) (< (mod (+ v_main_~x~0_Out_6 4294967295) 4294967296) 268435455) (= 2 |v_main_#t~post4_Out_8|) (= (* 2 v_main_~y~0_Out_10) 0) (= 2 v_main_~y~0_Out_10) (<= v_main_~x~0_In_3 v_main_~x~0_Out_6) (not (< (mod v_main_~y~0_Out_10 4294967296) 10))) (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) InVars {main_~x~0=v_main_~x~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_8|, main_#t~post5=|v_main_#t~post5_Out_6|, main_~y~0=v_main_~y~0_Out_10, main_~x~0=v_main_~x~0_Out_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {540#(= main_~x~0 0)} is VALID [2022-04-15 12:17:20,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#(= main_~x~0 0)} [56] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {536#false} is VALID [2022-04-15 12:17:20,115 INFO L272 TraceCheckUtils]: 8: Hoare triple {536#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {536#false} is VALID [2022-04-15 12:17:20,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#false} ~cond := #in~cond; {536#false} is VALID [2022-04-15 12:17:20,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#false} assume 0 == ~cond; {536#false} is VALID [2022-04-15 12:17:20,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#false} assume !false; {536#false} is VALID [2022-04-15 12:17:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:20,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:20,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836176906] [2022-04-15 12:17:20,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836176906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:20,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:20,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:20,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:20,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1500135158] [2022-04-15 12:17:20,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1500135158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:20,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:20,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:17:20,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698108457] [2022-04-15 12:17:20,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:20,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:17:20,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:20,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:20,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:17:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:20,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:17:20,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:17:20,221 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:20,365 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 12:17:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:17:20,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:17:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 12:17:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 12:17:20,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-15 12:17:20,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:20,404 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:17:20,404 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:17:20,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:17:20,406 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:20,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:17:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-15 12:17:20,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:20,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,416 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,416 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:20,417 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:17:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 12:17:20,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:20,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:20,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:17:20,419 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:17:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:20,421 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:17:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 12:17:20,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:20,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:20,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:20,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-15 12:17:20,425 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-04-15 12:17:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:20,425 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-15 12:17:20,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:20,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-15 12:17:20,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 12:17:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:17:20,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:20,468 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:20,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:17:20,469 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 907959386, now seen corresponding path program 4 times [2022-04-15 12:17:20,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:20,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [827957111] [2022-04-15 12:17:20,810 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash -467705142, now seen corresponding path program 1 times [2022-04-15 12:17:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:20,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195608626] [2022-04-15 12:17:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:20,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {705#(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(13, 2);call #Ultimate.allocInit(12, 3); {699#true} is VALID [2022-04-15 12:17:20,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {699#true} assume true; {699#true} is VALID [2022-04-15 12:17:20,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {699#true} {699#true} #47#return; {699#true} is VALID [2022-04-15 12:17:20,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:20,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#(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(13, 2);call #Ultimate.allocInit(12, 3); {699#true} is VALID [2022-04-15 12:17:20,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {699#true} assume true; {699#true} is VALID [2022-04-15 12:17:20,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {699#true} {699#true} #47#return; {699#true} is VALID [2022-04-15 12:17:20,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {699#true} call #t~ret6 := main(); {699#true} is VALID [2022-04-15 12:17:20,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {699#true} ~x~0 := 0;~y~0 := 0; {704#(= main_~x~0 0)} is VALID [2022-04-15 12:17:20,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#(= main_~x~0 0)} [59] L16-2-->L16-3_primed: Formula: (or (and (= (* 3 v_main_~y~0_Out_14) 0) (< (mod (+ v_main_~x~0_Out_8 4294967295) 4294967296) 268435455) (= 3 |v_main_#t~post4_Out_12|) (not (< (mod v_main_~y~0_Out_14 4294967296) 10)) (= (* 3 |v_main_#t~post5_Out_8|) 0) (= 3 v_main_~y~0_Out_14) (<= v_main_~x~0_In_4 v_main_~x~0_Out_8)) (= v_main_~x~0_In_4 v_main_~x~0_Out_8)) InVars {main_~x~0=v_main_~x~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_12|, main_#t~post5=|v_main_#t~post5_Out_8|, main_~y~0=v_main_~y~0_Out_14, main_~x~0=v_main_~x~0_Out_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {704#(= main_~x~0 0)} is VALID [2022-04-15 12:17:20,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#(= main_~x~0 0)} [58] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {700#false} is VALID [2022-04-15 12:17:20,900 INFO L272 TraceCheckUtils]: 8: Hoare triple {700#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {700#false} is VALID [2022-04-15 12:17:20,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {700#false} ~cond := #in~cond; {700#false} is VALID [2022-04-15 12:17:20,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {700#false} assume 0 == ~cond; {700#false} is VALID [2022-04-15 12:17:20,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {700#false} assume !false; {700#false} is VALID [2022-04-15 12:17:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:20,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:20,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195608626] [2022-04-15 12:17:20,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195608626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:20,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:20,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:20,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:20,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [827957111] [2022-04-15 12:17:20,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [827957111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:20,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:20,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:17:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802000222] [2022-04-15 12:17:20,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:20,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:17:20,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:20,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:21,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:17:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:21,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:17:21,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:17:21,009 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:21,239 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 12:17:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:17:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:17:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:17:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:17:21,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-15 12:17:21,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:21,329 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:17:21,329 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:17:21,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:17:21,331 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:21,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:17:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-04-15 12:17:21,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:21,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,345 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,345 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:21,347 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:17:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:21,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:21,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:21,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:17:21,361 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:17:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:21,362 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:17:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:21,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:21,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:21,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:21,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 12:17:21,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-04-15 12:17:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:21,367 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 12:17:21,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-15 12:17:21,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 12:17:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:17:21,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:21,389 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:21,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:17:21,389 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash 934170243, now seen corresponding path program 5 times [2022-04-15 12:17:21,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:21,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425381924] [2022-04-15 12:17:21,633 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash -408599798, now seen corresponding path program 1 times [2022-04-15 12:17:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:21,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596486285] [2022-04-15 12:17:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:21,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {878#(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(13, 2);call #Ultimate.allocInit(12, 3); {872#true} is VALID [2022-04-15 12:17:21,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-15 12:17:21,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {872#true} {872#true} #47#return; {872#true} is VALID [2022-04-15 12:17:21,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:21,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {878#(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(13, 2);call #Ultimate.allocInit(12, 3); {872#true} is VALID [2022-04-15 12:17:21,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#true} assume true; {872#true} is VALID [2022-04-15 12:17:21,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {872#true} {872#true} #47#return; {872#true} is VALID [2022-04-15 12:17:21,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {872#true} call #t~ret6 := main(); {872#true} is VALID [2022-04-15 12:17:21,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#true} ~x~0 := 0;~y~0 := 0; {877#(= main_~x~0 0)} is VALID [2022-04-15 12:17:21,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#(= main_~x~0 0)} [61] L16-2-->L16-3_primed: Formula: (or (and (= 4 |v_main_#t~post4_Out_16|) (< (mod (+ v_main_~y~0_Out_18 4294967293) 4294967296) 10) (< (mod (+ 4294967295 v_main_~x~0_Out_10) 4294967296) 268435455) (not (< (mod v_main_~y~0_Out_18 4294967296) 10)) (= (* v_main_~y~0_Out_18 4) 0) (<= v_main_~x~0_In_5 v_main_~x~0_Out_10) (= v_main_~y~0_Out_18 4) (< (mod (+ 4294967294 v_main_~y~0_Out_18) 4294967296) 10) (< (mod (+ 4294967295 v_main_~y~0_Out_18) 4294967296) 10) (= (* |v_main_#t~post5_Out_10| 4) 0)) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) InVars {main_~x~0=v_main_~x~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_16|, main_#t~post5=|v_main_#t~post5_Out_10|, main_~y~0=v_main_~y~0_Out_18, main_~x~0=v_main_~x~0_Out_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {877#(= main_~x~0 0)} is VALID [2022-04-15 12:17:21,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#(= main_~x~0 0)} [60] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {873#false} is VALID [2022-04-15 12:17:21,753 INFO L272 TraceCheckUtils]: 8: Hoare triple {873#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {873#false} is VALID [2022-04-15 12:17:21,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2022-04-15 12:17:21,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2022-04-15 12:17:21,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-15 12:17:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:21,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596486285] [2022-04-15 12:17:21,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596486285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:21,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:21,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:21,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:21,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425381924] [2022-04-15 12:17:21,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425381924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:21,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:21,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:17:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806500275] [2022-04-15 12:17:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:17:21,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:21,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:21,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:21,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:17:21,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:17:21,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:17:21,893 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,178 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:17:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:17:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:17:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-15 12:17:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-15 12:17:22,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-15 12:17:22,220 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 12:17:22,221 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:17:22,221 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:17:22,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:17:22,222 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:22,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:17:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-15 12:17:22,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:22,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 12:17:22,231 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 12:17:22,231 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 12:17:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,232 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:17:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:17:22,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 24 states. [2022-04-15 12:17:22,233 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 24 states. [2022-04-15 12:17:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,233 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:17:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:17:22,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:22,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 12:17:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-15 12:17:22,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2022-04-15 12:17:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:22,248 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-15 12:17:22,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-15 12:17:22,378 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 12:17:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:17:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:17:22,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:22,379 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:22,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:17:22,380 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1746706810, now seen corresponding path program 6 times [2022-04-15 12:17:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:22,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954548028] [2022-04-15 12:17:22,936 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash -349494454, now seen corresponding path program 1 times [2022-04-15 12:17:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:22,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595919939] [2022-04-15 12:17:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:23,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {1060#(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(13, 2);call #Ultimate.allocInit(12, 3); {1054#true} is VALID [2022-04-15 12:17:23,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1054#true} assume true; {1054#true} is VALID [2022-04-15 12:17:23,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1054#true} {1054#true} #47#return; {1054#true} is VALID [2022-04-15 12:17:23,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {1054#true} call ULTIMATE.init(); {1060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:23,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1060#(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(13, 2);call #Ultimate.allocInit(12, 3); {1054#true} is VALID [2022-04-15 12:17:23,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1054#true} assume true; {1054#true} is VALID [2022-04-15 12:17:23,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1054#true} {1054#true} #47#return; {1054#true} is VALID [2022-04-15 12:17:23,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1054#true} call #t~ret6 := main(); {1054#true} is VALID [2022-04-15 12:17:23,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {1054#true} ~x~0 := 0;~y~0 := 0; {1059#(= main_~x~0 0)} is VALID [2022-04-15 12:17:23,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {1059#(= main_~x~0 0)} [63] L16-2-->L16-3_primed: Formula: (or (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (and (<= v_main_~x~0_In_6 v_main_~x~0_Out_12) (< (mod (+ 4294967294 v_main_~y~0_Out_22) 4294967296) 10) (= (* 5 v_main_~y~0_Out_22) 0) (= (* |v_main_#t~post5_Out_12| 5) 0) (= 5 |v_main_#t~post4_Out_20|) (= 5 v_main_~y~0_Out_22) (not (< (mod v_main_~y~0_Out_22 4294967296) 10)) (< (mod (+ 4294967295 v_main_~x~0_Out_12) 4294967296) 268435455) (< (mod (+ v_main_~y~0_Out_22 4294967293) 4294967296) 10) (< (mod (+ 4294967295 v_main_~y~0_Out_22) 4294967296) 10))) InVars {main_~x~0=v_main_~x~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_20|, main_#t~post5=|v_main_#t~post5_Out_12|, main_~y~0=v_main_~y~0_Out_22, main_~x~0=v_main_~x~0_Out_12} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1059#(= main_~x~0 0)} is VALID [2022-04-15 12:17:23,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {1059#(= main_~x~0 0)} [62] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-15 12:17:23,021 INFO L272 TraceCheckUtils]: 8: Hoare triple {1055#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1055#false} is VALID [2022-04-15 12:17:23,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {1055#false} ~cond := #in~cond; {1055#false} is VALID [2022-04-15 12:17:23,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {1055#false} assume 0 == ~cond; {1055#false} is VALID [2022-04-15 12:17:23,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {1055#false} assume !false; {1055#false} is VALID [2022-04-15 12:17:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:23,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595919939] [2022-04-15 12:17:23,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595919939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:23,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:23,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:23,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:23,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954548028] [2022-04-15 12:17:23,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954548028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:23,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:23,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:17:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031039688] [2022-04-15 12:17:23,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:17:23,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:23,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:23,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:17:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:17:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:17:23,151 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:23,546 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 12:17:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:17:23,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:17:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:17:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:17:23,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-04-15 12:17:23,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:23,595 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:17:23,595 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:17:23,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:17:23,596 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:23,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 39 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:17:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-04-15 12:17:23,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:23,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,607 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,607 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:23,609 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:17:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:23,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:23,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:23,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:17:23,610 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:17:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:23,611 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:17:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:23,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:23,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:23,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:23,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-15 12:17:23,612 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2022-04-15 12:17:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:23,612 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-15 12:17:23,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-15 12:17:23,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 12:17:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:17:23,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:23,653 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:23,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:17:23,653 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:23,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:23,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1165536611, now seen corresponding path program 7 times [2022-04-15 12:17:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:23,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394034964] [2022-04-15 12:17:23,909 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -290389110, now seen corresponding path program 1 times [2022-04-15 12:17:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:23,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227071851] [2022-04-15 12:17:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {1251#(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(13, 2);call #Ultimate.allocInit(12, 3); {1245#true} is VALID [2022-04-15 12:17:24,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-04-15 12:17:24,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1245#true} {1245#true} #47#return; {1245#true} is VALID [2022-04-15 12:17:24,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {1245#true} call ULTIMATE.init(); {1251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:24,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1251#(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(13, 2);call #Ultimate.allocInit(12, 3); {1245#true} is VALID [2022-04-15 12:17:24,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#true} assume true; {1245#true} is VALID [2022-04-15 12:17:24,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1245#true} {1245#true} #47#return; {1245#true} is VALID [2022-04-15 12:17:24,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1245#true} call #t~ret6 := main(); {1245#true} is VALID [2022-04-15 12:17:24,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#true} ~x~0 := 0;~y~0 := 0; {1250#(= main_~x~0 0)} is VALID [2022-04-15 12:17:24,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {1250#(= main_~x~0 0)} [65] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_26 6) (< (mod (+ 4294967291 v_main_~y~0_Out_26) 4294967296) 10) (< (mod (+ v_main_~y~0_Out_26 4294967293) 4294967296) 10) (< (mod (+ 4294967295 v_main_~x~0_Out_14) 4294967296) 268435455) (not (< (mod v_main_~y~0_Out_26 4294967296) 10)) (< (mod (+ 4294967295 v_main_~y~0_Out_26) 4294967296) 10) (= 6 |v_main_#t~post4_Out_24|) (<= v_main_~x~0_In_7 v_main_~x~0_Out_14) (< (mod (+ 4294967292 v_main_~y~0_Out_26) 4294967296) 10) (< (mod (+ 4294967294 v_main_~y~0_Out_26) 4294967296) 10) (= (* v_main_~y~0_Out_26 6) 0) (= (* |v_main_#t~post5_Out_14| 6) 0)) (= v_main_~x~0_In_7 v_main_~x~0_Out_14)) InVars {main_~x~0=v_main_~x~0_In_7} OutVars{main_#t~post4=|v_main_#t~post4_Out_24|, main_#t~post5=|v_main_#t~post5_Out_14|, main_~y~0=v_main_~y~0_Out_26, main_~x~0=v_main_~x~0_Out_14} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1250#(= main_~x~0 0)} is VALID [2022-04-15 12:17:24,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {1250#(= main_~x~0 0)} [64] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1246#false} is VALID [2022-04-15 12:17:24,021 INFO L272 TraceCheckUtils]: 8: Hoare triple {1246#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1246#false} is VALID [2022-04-15 12:17:24,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {1246#false} ~cond := #in~cond; {1246#false} is VALID [2022-04-15 12:17:24,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {1246#false} assume 0 == ~cond; {1246#false} is VALID [2022-04-15 12:17:24,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {1246#false} assume !false; {1246#false} is VALID [2022-04-15 12:17:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:24,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:24,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227071851] [2022-04-15 12:17:24,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227071851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:24,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394034964] [2022-04-15 12:17:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394034964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:17:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483184016] [2022-04-15 12:17:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:17:24,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:24,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:24,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:17:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:17:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:17:24,332 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,697 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 12:17:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:17:24,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:17:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 12:17:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-15 12:17:24,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-15 12:17:24,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:24,734 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:17:24,734 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:17:24,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:17:24,735 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:24,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:17:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-04-15 12:17:24,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:24,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,767 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,768 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,770 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:17:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:17:24,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:17:24,771 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:17:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,772 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:17:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:17:24,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:24,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 12:17:24,774 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2022-04-15 12:17:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:24,774 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 12:17:24,774 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:24,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-15 12:17:24,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:17:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:17:24,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:24,823 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:24,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 12:17:24,823 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 329129626, now seen corresponding path program 8 times [2022-04-15 12:17:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [100995053] [2022-04-15 12:17:25,255 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -231283766, now seen corresponding path program 1 times [2022-04-15 12:17:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:25,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697171812] [2022-04-15 12:17:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {1451#(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(13, 2);call #Ultimate.allocInit(12, 3); {1445#true} is VALID [2022-04-15 12:17:25,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {1445#true} assume true; {1445#true} is VALID [2022-04-15 12:17:25,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1445#true} {1445#true} #47#return; {1445#true} is VALID [2022-04-15 12:17:25,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {1445#true} call ULTIMATE.init(); {1451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:25,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#(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(13, 2);call #Ultimate.allocInit(12, 3); {1445#true} is VALID [2022-04-15 12:17:25,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {1445#true} assume true; {1445#true} is VALID [2022-04-15 12:17:25,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1445#true} {1445#true} #47#return; {1445#true} is VALID [2022-04-15 12:17:25,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {1445#true} call #t~ret6 := main(); {1445#true} is VALID [2022-04-15 12:17:25,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {1445#true} ~x~0 := 0;~y~0 := 0; {1450#(= main_~x~0 0)} is VALID [2022-04-15 12:17:25,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#(= main_~x~0 0)} [67] L16-2-->L16-3_primed: Formula: (or (and (= 7 |v_main_#t~post4_Out_28|) (< (mod (+ 4294967294 v_main_~y~0_Out_30) 4294967296) 10) (< (mod (+ v_main_~y~0_Out_30 4294967293) 4294967296) 10) (< (mod (+ 4294967291 v_main_~y~0_Out_30) 4294967296) 10) (= (* 7 v_main_~y~0_Out_30) 0) (= (* 7 |v_main_#t~post5_Out_16|) 0) (<= v_main_~x~0_In_8 v_main_~x~0_Out_16) (< (mod (+ 4294967290 v_main_~y~0_Out_30) 4294967296) 10) (not (< (mod v_main_~y~0_Out_30 4294967296) 10)) (< (mod (+ 4294967295 v_main_~y~0_Out_30) 4294967296) 10) (< (mod (+ 4294967295 v_main_~x~0_Out_16) 4294967296) 268435455) (< (mod (+ 4294967292 v_main_~y~0_Out_30) 4294967296) 10) (< (mod (+ v_main_~y~0_Out_30 4294967289) 4294967296) 10) (= 7 v_main_~y~0_Out_30)) (= v_main_~x~0_In_8 v_main_~x~0_Out_16)) InVars {main_~x~0=v_main_~x~0_In_8} OutVars{main_#t~post4=|v_main_#t~post4_Out_28|, main_#t~post5=|v_main_#t~post5_Out_16|, main_~y~0=v_main_~y~0_Out_30, main_~x~0=v_main_~x~0_Out_16} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1450#(= main_~x~0 0)} is VALID [2022-04-15 12:17:25,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#(= main_~x~0 0)} [66] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1446#false} is VALID [2022-04-15 12:17:25,412 INFO L272 TraceCheckUtils]: 8: Hoare triple {1446#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1446#false} is VALID [2022-04-15 12:17:25,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {1446#false} ~cond := #in~cond; {1446#false} is VALID [2022-04-15 12:17:25,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#false} assume 0 == ~cond; {1446#false} is VALID [2022-04-15 12:17:25,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#false} assume !false; {1446#false} is VALID [2022-04-15 12:17:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697171812] [2022-04-15 12:17:25,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697171812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:25,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:25,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [100995053] [2022-04-15 12:17:25,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [100995053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:17:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37179807] [2022-04-15 12:17:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:25,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:17:25,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:25,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:25,832 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 12:17:25,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:17:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:25,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:17:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:17:25,833 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,538 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 12:17:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:17:26,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:17:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2022-04-15 12:17:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2022-04-15 12:17:26,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2022-04-15 12:17:26,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:26,600 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:17:26,600 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:17:26,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:17:26,601 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:26,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 54 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:17:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-04-15 12:17:26,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:26,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,625 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,631 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,632 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:17:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:26,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:17:26,634 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:17:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,634 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:17:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:26,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:26,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-15 12:17:26,636 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2022-04-15 12:17:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:26,636 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-15 12:17:26,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:26,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-15 12:17:26,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 12:17:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:17:26,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:26,700 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:26,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 12:17:26,700 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash 170316867, now seen corresponding path program 9 times [2022-04-15 12:17:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:26,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843118548] [2022-04-15 12:17:27,057 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -172178422, now seen corresponding path program 1 times [2022-04-15 12:17:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:27,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411864845] [2022-04-15 12:17:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {1660#(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(13, 2);call #Ultimate.allocInit(12, 3); {1654#true} is VALID [2022-04-15 12:17:27,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-15 12:17:27,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1654#true} {1654#true} #47#return; {1654#true} is VALID [2022-04-15 12:17:27,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:27,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {1660#(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(13, 2);call #Ultimate.allocInit(12, 3); {1654#true} is VALID [2022-04-15 12:17:27,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-15 12:17:27,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1654#true} {1654#true} #47#return; {1654#true} is VALID [2022-04-15 12:17:27,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1654#true} call #t~ret6 := main(); {1654#true} is VALID [2022-04-15 12:17:27,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {1654#true} ~x~0 := 0;~y~0 := 0; {1659#(= main_~x~0 0)} is VALID [2022-04-15 12:17:27,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#(= main_~x~0 0)} [69] L16-2-->L16-3_primed: Formula: (or (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (and (= (* |v_main_#t~post5_Out_18| 8) 0) (= (* v_main_~y~0_Out_34 8) 0) (< (mod (+ 4294967295 v_main_~x~0_Out_18) 4294967296) 268435455) (= 8 |v_main_#t~post4_Out_32|) (not (< (mod v_main_~y~0_Out_34 4294967296) 10)) (= v_main_~y~0_Out_34 8) (<= v_main_~x~0_In_9 v_main_~x~0_Out_18) (< (mod (+ 4294967295 v_main_~y~0_Out_34) 4294967296) 10) (< (mod (+ 4294967294 v_main_~y~0_Out_34) 4294967296) 10) (< (mod (+ v_main_~y~0_Out_34 4294967293) 4294967296) 10))) InVars {main_~x~0=v_main_~x~0_In_9} OutVars{main_#t~post4=|v_main_#t~post4_Out_32|, main_#t~post5=|v_main_#t~post5_Out_18|, main_~y~0=v_main_~y~0_Out_34, main_~x~0=v_main_~x~0_Out_18} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1659#(= main_~x~0 0)} is VALID [2022-04-15 12:17:27,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#(= main_~x~0 0)} [68] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1655#false} is VALID [2022-04-15 12:17:27,127 INFO L272 TraceCheckUtils]: 8: Hoare triple {1655#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1655#false} is VALID [2022-04-15 12:17:27,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-15 12:17:27,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-15 12:17:27,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-15 12:17:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:27,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411864845] [2022-04-15 12:17:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411864845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:27,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:27,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:27,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:27,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843118548] [2022-04-15 12:17:27,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843118548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:27,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:27,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:17:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250065554] [2022-04-15 12:17:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:27,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:17:27,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:27,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:27,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:17:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:27,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:17:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:17:27,460 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,927 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 12:17:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:17:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:17:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2022-04-15 12:17:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2022-04-15 12:17:27,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 38 transitions. [2022-04-15 12:17:27,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:27,964 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:17:27,964 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:17:27,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:17:27,965 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:27,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:17:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-15 12:17:27,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:27,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 12:17:27,984 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 12:17:27,985 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 12:17:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,988 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 12:17:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:17:27,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 28 states. [2022-04-15 12:17:27,989 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 28 states. [2022-04-15 12:17:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,990 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 12:17:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 12:17:27,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:27,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 12:17:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-15 12:17:27,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2022-04-15 12:17:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:27,999 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-15 12:17:27,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:27,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-15 12:17:28,039 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 12:17:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-15 12:17:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:17:28,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:28,040 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:28,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 12:17:28,041 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:28,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -457911366, now seen corresponding path program 10 times [2022-04-15 12:17:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:28,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190289275] [2022-04-15 12:17:28,314 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash -113073078, now seen corresponding path program 1 times [2022-04-15 12:17:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:28,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247066362] [2022-04-15 12:17:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {1878#(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(13, 2);call #Ultimate.allocInit(12, 3); {1872#true} is VALID [2022-04-15 12:17:28,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1872#true} assume true; {1872#true} is VALID [2022-04-15 12:17:28,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1872#true} {1872#true} #47#return; {1872#true} is VALID [2022-04-15 12:17:28,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {1872#true} call ULTIMATE.init(); {1878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:28,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {1878#(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(13, 2);call #Ultimate.allocInit(12, 3); {1872#true} is VALID [2022-04-15 12:17:28,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1872#true} assume true; {1872#true} is VALID [2022-04-15 12:17:28,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1872#true} {1872#true} #47#return; {1872#true} is VALID [2022-04-15 12:17:28,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {1872#true} call #t~ret6 := main(); {1872#true} is VALID [2022-04-15 12:17:28,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1872#true} ~x~0 := 0;~y~0 := 0; {1877#(= main_~x~0 0)} is VALID [2022-04-15 12:17:28,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {1877#(= main_~x~0 0)} [71] L16-2-->L16-3_primed: Formula: (or (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (and (= (* 9 v_main_~y~0_Out_38) 0) (= (* |v_main_#t~post5_Out_20| 9) 0) (< (mod (+ 4294967295 v_main_~y~0_Out_38) 4294967296) 10) (< (mod (+ 4294967294 v_main_~y~0_Out_38) 4294967296) 10) (< (mod (+ v_main_~y~0_Out_38 4294967293) 4294967296) 10) (= 9 |v_main_#t~post4_Out_36|) (= 9 v_main_~y~0_Out_38) (not (< (mod v_main_~y~0_Out_38 4294967296) 10)) (<= v_main_~x~0_In_10 v_main_~x~0_Out_20) (< (mod (+ 4294967295 v_main_~x~0_Out_20) 4294967296) 268435455))) InVars {main_~x~0=v_main_~x~0_In_10} OutVars{main_#t~post4=|v_main_#t~post4_Out_36|, main_#t~post5=|v_main_#t~post5_Out_20|, main_~y~0=v_main_~y~0_Out_38, main_~x~0=v_main_~x~0_Out_20} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1877#(= main_~x~0 0)} is VALID [2022-04-15 12:17:28,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {1877#(= main_~x~0 0)} [70] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1873#false} is VALID [2022-04-15 12:17:28,403 INFO L272 TraceCheckUtils]: 8: Hoare triple {1873#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1873#false} is VALID [2022-04-15 12:17:28,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {1873#false} ~cond := #in~cond; {1873#false} is VALID [2022-04-15 12:17:28,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {1873#false} assume 0 == ~cond; {1873#false} is VALID [2022-04-15 12:17:28,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {1873#false} assume !false; {1873#false} is VALID [2022-04-15 12:17:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:28,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:28,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247066362] [2022-04-15 12:17:28,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247066362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:28,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:28,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:28,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190289275] [2022-04-15 12:17:28,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190289275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:28,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:28,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:17:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685996738] [2022-04-15 12:17:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:28,681 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:17:28,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:28,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:28,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:28,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:17:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:17:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:17:28,701 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,320 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 12:17:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:17:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:17:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2022-04-15 12:17:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2022-04-15 12:17:29,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 39 transitions. [2022-04-15 12:17:29,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:29,442 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:17:29,442 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:17:29,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:17:29,443 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:29,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:29,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:17:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-15 12:17:29,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:29,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,461 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,461 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,462 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:17:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:29,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:17:29,463 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:17:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,463 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:17:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:29,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:29,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-15 12:17:29,465 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2022-04-15 12:17:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:29,465 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-15 12:17:29,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-15 12:17:29,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 12:17:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:17:29,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:29,537 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:29,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 12:17:29,538 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1541849891, now seen corresponding path program 11 times [2022-04-15 12:17:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:29,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803809167] [2022-04-15 12:17:29,817 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -53967734, now seen corresponding path program 1 times [2022-04-15 12:17:29,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:29,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493961106] [2022-04-15 12:17:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:29,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {2105#(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(13, 2);call #Ultimate.allocInit(12, 3); {2099#true} is VALID [2022-04-15 12:17:29,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume true; {2099#true} is VALID [2022-04-15 12:17:29,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2099#true} {2099#true} #47#return; {2099#true} is VALID [2022-04-15 12:17:29,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:29,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {2105#(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(13, 2);call #Ultimate.allocInit(12, 3); {2099#true} is VALID [2022-04-15 12:17:29,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2022-04-15 12:17:29,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #47#return; {2099#true} is VALID [2022-04-15 12:17:29,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret6 := main(); {2099#true} is VALID [2022-04-15 12:17:29,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {2099#true} ~x~0 := 0;~y~0 := 0; {2104#(= main_~x~0 0)} is VALID [2022-04-15 12:17:29,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {2104#(= main_~x~0 0)} [73] L16-2-->L16-3_primed: Formula: (or (and (< (mod (+ 4294967294 v_main_~y~0_Out_42) 4294967296) 10) (< (mod (+ 4294967292 v_main_~y~0_Out_42) 4294967296) 10) (= (* |v_main_#t~post5_Out_22| 10) 0) (= v_main_~y~0_Out_42 10) (< (mod (+ 4294967291 v_main_~y~0_Out_42) 4294967296) 10) (< (mod (+ 4294967290 v_main_~y~0_Out_42) 4294967296) 10) (< (mod (+ v_main_~y~0_Out_42 4294967289) 4294967296) 10) (= 10 |v_main_#t~post4_Out_40|) (< (mod (+ v_main_~y~0_Out_42 4294967293) 4294967296) 10) (not (< (mod v_main_~y~0_Out_42 4294967296) 10)) (< (mod (+ 4294967295 v_main_~y~0_Out_42) 4294967296) 10) (= (* v_main_~y~0_Out_42 10) 0) (< (mod (+ 4294967295 v_main_~x~0_Out_22) 4294967296) 268435455) (<= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) InVars {main_~x~0=v_main_~x~0_In_11} OutVars{main_#t~post4=|v_main_#t~post4_Out_40|, main_#t~post5=|v_main_#t~post5_Out_22|, main_~y~0=v_main_~y~0_Out_42, main_~x~0=v_main_~x~0_Out_22} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {2104#(= main_~x~0 0)} is VALID [2022-04-15 12:17:29,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(= main_~x~0 0)} [72] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2100#false} is VALID [2022-04-15 12:17:29,885 INFO L272 TraceCheckUtils]: 8: Hoare triple {2100#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2100#false} is VALID [2022-04-15 12:17:29,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2022-04-15 12:17:29,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {2100#false} assume 0 == ~cond; {2100#false} is VALID [2022-04-15 12:17:29,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2022-04-15 12:17:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:29,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:29,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493961106] [2022-04-15 12:17:29,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493961106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:29,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:29,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:30,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:30,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [803809167] [2022-04-15 12:17:30,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [803809167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:30,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:30,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:17:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586120676] [2022-04-15 12:17:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:30,124 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:17:30,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:30,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:30,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:30,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:17:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:30,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:17:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:17:30,146 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:30,947 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:17:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:17:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:17:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 40 transitions. [2022-04-15 12:17:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 40 transitions. [2022-04-15 12:17:30,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 40 transitions. [2022-04-15 12:17:30,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:30,998 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:17:30,998 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:17:30,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:17:30,999 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:30,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:17:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:17:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:17:31,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:31,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:31,021 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:31,021 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:31,023 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 12:17:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 12:17:31,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:31,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:31,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:17:31,027 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:17:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:31,029 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 12:17:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 12:17:31,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:31,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:31,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:31,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-15 12:17:31,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2022-04-15 12:17:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:31,030 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-15 12:17:31,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:31,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2022-04-15 12:17:31,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 12:17:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:17:31,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:31,099 INFO L499 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:31,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 12:17:31,100 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1413925193, now seen corresponding path program 12 times [2022-04-15 12:17:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:31,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1174840804] [2022-04-15 12:17:31,695 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) 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 12:17:31,699 INFO L158 Benchmark]: Toolchain (without parser) took 16275.65ms. Allocated memory was 172.0MB in the beginning and 253.8MB in the end (delta: 81.8MB). Free memory was 117.0MB in the beginning and 198.7MB in the end (delta: -81.7MB). Peak memory consumption was 118.5MB. Max. memory is 8.0GB. [2022-04-15 12:17:31,700 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 172.0MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:17:31,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.13ms. Allocated memory was 172.0MB in the beginning and 210.8MB in the end (delta: 38.8MB). Free memory was 116.9MB in the beginning and 183.7MB in the end (delta: -66.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-15 12:17:31,700 INFO L158 Benchmark]: Boogie Preprocessor took 39.79ms. Allocated memory is still 210.8MB. Free memory was 183.7MB in the beginning and 182.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:17:31,700 INFO L158 Benchmark]: RCFGBuilder took 462.16ms. Allocated memory is still 210.8MB. Free memory was 182.3MB in the beginning and 171.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:17:31,700 INFO L158 Benchmark]: TraceAbstraction took 15312.46ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 171.4MB in the beginning and 198.7MB in the end (delta: -27.3MB). Peak memory consumption was 132.8MB. Max. memory is 8.0GB. [2022-04-15 12:17:31,701 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.23ms. Allocated memory is still 172.0MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 443.13ms. Allocated memory was 172.0MB in the beginning and 210.8MB in the end (delta: 38.8MB). Free memory was 116.9MB in the beginning and 183.7MB in the end (delta: -66.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.79ms. Allocated memory is still 210.8MB. Free memory was 183.7MB in the beginning and 182.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 462.16ms. Allocated memory is still 210.8MB. Free memory was 182.3MB in the beginning and 171.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15312.46ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 171.4MB in the beginning and 198.7MB in the end (delta: -27.3MB). Peak memory consumption was 132.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:17:31,732 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...