/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/underapprox_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:25:28,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:25:28,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:25:28,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:25:28,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:25:28,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:25:28,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:25:28,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:25:28,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:25:28,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:25:28,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:25:28,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:25:28,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:25:28,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:25:28,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:25:28,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:25:28,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:25:28,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:25:28,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:25:28,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:25:28,566 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:25:28,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:25:28,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:25:28,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:25:28,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:25:28,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:25:28,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:25:28,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:25:28,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:25:28,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:25:28,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:25:28,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:25:28,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:25:28,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:25:28,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:25:28,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:25:28,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:25:28,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:25:28,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:25:28,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:25:28,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:25:28,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:25:28,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:25:28,595 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:25:28,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:25:28,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:25:28,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:25:28,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:25:28,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:25:28,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:25:28,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:25:28,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:25:28,598 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:25:28,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:25:28,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:25:28,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:25:28,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:25:28,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:25:28,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:28,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:25:28,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:25:28,599 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:25:28,599 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:25:28,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:25:28,600 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:25:28,600 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:25:28,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:25:28,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:25:28,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:25:28,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:25:28,859 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:25:28,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_2-2.c [2022-04-08 09:25:28,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd065a707/112ca23ed18242d4a1fbd1d3fc51792f/FLAG467c2ba66 [2022-04-08 09:25:29,264 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:25:29,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-2.c [2022-04-08 09:25:29,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd065a707/112ca23ed18242d4a1fbd1d3fc51792f/FLAG467c2ba66 [2022-04-08 09:25:29,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd065a707/112ca23ed18242d4a1fbd1d3fc51792f [2022-04-08 09:25:29,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:25:29,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:25:29,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:29,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:25:29,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:25:29,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58553ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29, skipping insertion in model container [2022-04-08 09:25:29,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:25:29,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:25:29,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-2.c[327,340] [2022-04-08 09:25:29,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:29,470 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:25:29,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-2.c[327,340] [2022-04-08 09:25:29,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:29,492 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:25:29,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29 WrapperNode [2022-04-08 09:25:29,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:29,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:25:29,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:25:29,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:25:29,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:25:29,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:25:29,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:25:29,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:25:29,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (1/1) ... [2022-04-08 09:25:29,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:29,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:29,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:25:29,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:25:29,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:25:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:25:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:25:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:25:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:25:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:25:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:25:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:25:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:25:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:25:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:25:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:25:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:25:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:25:29,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:25:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:25:29,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:25:29,666 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:25:29,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:25:29,791 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:25:29,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:25:29,796 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:25:29,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:29 BoogieIcfgContainer [2022-04-08 09:25:29,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:25:29,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:25:29,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:25:29,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:25:29,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:25:29" (1/3) ... [2022-04-08 09:25:29,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538f2ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:29, skipping insertion in model container [2022-04-08 09:25:29,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:29" (2/3) ... [2022-04-08 09:25:29,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538f2ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:29, skipping insertion in model container [2022-04-08 09:25:29,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:29" (3/3) ... [2022-04-08 09:25:29,803 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_2-2.c [2022-04-08 09:25:29,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:25:29,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:25:29,839 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:25:29,844 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:25:29,844 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:25:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:25:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:25:29,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:29,873 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:29,874 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-08 09:25:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:29,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082908228] [2022-04-08 09:25:29,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:25:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-08 09:25:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826262421] [2022-04-08 09:25:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:30,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:30,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-08 09:25:30,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:25:30,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-08 09:25:30,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:30,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-08 09:25:30,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:25:30,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-08 09:25:30,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-08 09:25:30,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-08 09:25:30,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-08 09:25:30,041 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-08 09:25:30,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-08 09:25:30,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-08 09:25:30,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-08 09:25:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:30,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826262421] [2022-04-08 09:25:30,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826262421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:30,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:30,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:25:30,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:30,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082908228] [2022-04-08 09:25:30,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082908228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:30,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:30,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:25:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021363809] [2022-04-08 09:25:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:30,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:25:30,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:30,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:30,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:25:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:25:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:25:30,091 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:30,148 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 09:25:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:25:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:25:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-08 09:25:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-08 09:25:30,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-08 09:25:30,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:30,201 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:25:30,201 INFO L226 Difference]: Without dead ends: 12 [2022-04-08 09:25:30,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:25:30,206 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:30,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-08 09:25:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-08 09:25:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:30,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,231 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,232 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:30,234 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-08 09:25:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 09:25:30,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:30,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:30,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-08 09:25:30,235 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-08 09:25:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:30,237 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-08 09:25:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 09:25:30,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:30,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:30,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:30,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-08 09:25:30,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-08 09:25:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:30,241 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-08 09:25:30,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-08 09:25:30,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 09:25:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:25:30,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:30,257 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:30,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:25:30,257 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-08 09:25:30,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:30,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050035196] [2022-04-08 09:25:30,260 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:25:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-08 09:25:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:30,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968401572] [2022-04-08 09:25:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:30,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:30,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-08 09:25:30,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-08 09:25:30,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-08 09:25:30,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:30,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-08 09:25:30,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-08 09:25:30,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-08 09:25:30,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-08 09:25:30,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-08 09:25:30,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-08 09:25:30,349 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-08 09:25:30,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-08 09:25:30,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-08 09:25:30,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-08 09:25:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:30,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:30,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968401572] [2022-04-08 09:25:30,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968401572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:30,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:30,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:30,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:30,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050035196] [2022-04-08 09:25:30,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050035196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:30,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:30,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:30,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939116136] [2022-04-08 09:25:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:25:30,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:30,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:30,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:25:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:25:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:25:30,373 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:30,438 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:25:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:25:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:25:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-08 09:25:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-08 09:25:30,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-08 09:25:30,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:30,481 INFO L225 Difference]: With dead ends: 18 [2022-04-08 09:25:30,481 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 09:25:30,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:25:30,483 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:30,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 09:25:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 09:25:30,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:30,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,489 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,489 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:30,491 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:25:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:25:30,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:30,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:30,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-08 09:25:30,492 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-08 09:25:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:30,494 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:25:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:25:30,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:30,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:30,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:30,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 09:25:30,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 09:25:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:30,499 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 09:25:30,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:30,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 09:25:30,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:25:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:25:30,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:30,520 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:30,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:25:30,520 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-08 09:25:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:30,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660381549] [2022-04-08 09:25:30,543 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:30,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-08 09:25:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:30,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983692320] [2022-04-08 09:25:30,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:30,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-08 09:25:30,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:30,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:30,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:30,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-08 09:25:30,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:30,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:30,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 09:25:30,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-08 09:25:30,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {240#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:25:30,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-08 09:25:30,685 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-08 09:25:30,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-08 09:25:30,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-08 09:25:30,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 09:25:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:30,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983692320] [2022-04-08 09:25:30,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983692320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:30,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938664188] [2022-04-08 09:25:30,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:25:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:30,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:30,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:30,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:25:30,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:25:30,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:30,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:25:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:30,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:30,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-08 09:25:30,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-08 09:25:30,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:30,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:30,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 09:25:30,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-08 09:25:30,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {263#(= main_~x~0 1)} is VALID [2022-04-08 09:25:30,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 6); {235#false} is VALID [2022-04-08 09:25:30,835 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-08 09:25:30,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-08 09:25:30,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-08 09:25:30,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 09:25:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:30,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:31,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 09:25:31,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {235#false} is VALID [2022-04-08 09:25:31,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {282#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:25:31,044 INFO L272 TraceCheckUtils]: 8: Hoare triple {290#(= (mod main_~x~0 4294967296) 6)} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {286#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:31,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {290#(= (mod main_~x~0 4294967296) 6)} is VALID [2022-04-08 09:25:31,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {294#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} is VALID [2022-04-08 09:25:31,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {298#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} is VALID [2022-04-08 09:25:31,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 09:25:31,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:31,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:31,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-08 09:25:31,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-08 09:25:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:31,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938664188] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:31,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:31,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-08 09:25:31,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660381549] [2022-04-08 09:25:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660381549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:31,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:31,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:25:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607499270] [2022-04-08 09:25:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:31,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:25:31,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:31,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:31,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:25:31,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:25:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:25:31,065 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:31,134 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:25:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:25:31,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:25:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 09:25:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 09:25:31,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-08 09:25:31,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:31,165 INFO L225 Difference]: With dead ends: 19 [2022-04-08 09:25:31,165 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:25:31,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:25:31,172 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:31,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:25:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:25:31,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:31,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,183 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,183 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:31,184 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:25:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:25:31,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:31,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:31,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 09:25:31,185 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 09:25:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:31,187 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:25:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:25:31,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:31,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:31,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:31,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 09:25:31,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-08 09:25:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:31,189 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 09:25:31,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 09:25:31,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:25:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:25:31,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:31,207 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:31,231 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-08 09:25:31,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:31,424 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-08 09:25:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:31,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759934798] [2022-04-08 09:25:31,429 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:31,429 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-08 09:25:31,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:31,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305450544] [2022-04-08 09:25:31,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:31,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:31,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-08 09:25:31,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:31,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:31,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:31,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-08 09:25:31,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:31,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:31,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 09:25:31,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {422#(= main_~x~0 0)} is VALID [2022-04-08 09:25:31,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {423#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:31,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:31,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {418#false} is VALID [2022-04-08 09:25:31,518 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-08 09:25:31,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-08 09:25:31,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-08 09:25:31,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 09:25:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305450544] [2022-04-08 09:25:31,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305450544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790206752] [2022-04-08 09:25:31,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:25:31,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:31,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:31,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:31,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:25:31,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:25:31,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:31,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:25:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:31,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:31,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 09:25:31,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-08 09:25:31,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:31,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:31,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 09:25:31,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {422#(= main_~x~0 0)} is VALID [2022-04-08 09:25:31,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {423#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:31,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {450#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:31,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {418#false} is VALID [2022-04-08 09:25:31,647 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-08 09:25:31,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-08 09:25:31,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-08 09:25:31,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 09:25:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:31,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:31,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 09:25:31,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {418#false} is VALID [2022-04-08 09:25:31,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {469#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:25:31,841 INFO L272 TraceCheckUtils]: 9: Hoare triple {477#(= (mod main_~x~0 4294967296) 6)} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {473#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:31,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {477#(= (mod main_~x~0 4294967296) 6)} is VALID [2022-04-08 09:25:31,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {481#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} is VALID [2022-04-08 09:25:31,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(or (< (mod (+ main_~x~0 2) 4294967296) 6) (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {485#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} is VALID [2022-04-08 09:25:31,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {489#(or (< (mod (+ main_~x~0 2) 4294967296) 6) (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-08 09:25:31,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 09:25:31,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:31,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:31,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-08 09:25:31,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 09:25:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:31,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790206752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:31,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:31,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 13 [2022-04-08 09:25:31,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:31,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759934798] [2022-04-08 09:25:31,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759934798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:31,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:31,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:25:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33950729] [2022-04-08 09:25:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:31,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:25:31,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:31,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:31,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:25:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:25:31,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:25:31,861 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:31,943 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 09:25:31,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:25:31,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:25:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 09:25:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 09:25:31,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 09:25:31,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:31,974 INFO L225 Difference]: With dead ends: 20 [2022-04-08 09:25:31,974 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:25:31,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:25:31,976 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:31,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:25:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:25:31,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:31,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,984 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,984 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:31,985 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:25:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:25:31,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:31,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:31,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:25:31,986 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:25:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:31,987 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:25:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:25:31,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:31,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:31,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:31,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:25:31,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 09:25:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:31,989 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:25:31,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:31,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:25:32,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:25:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:25:32,002 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:32,002 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:32,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:25:32,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 09:25:32,225 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-08 09:25:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:32,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535290286] [2022-04-08 09:25:32,232 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:32,232 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-08 09:25:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:32,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336409874] [2022-04-08 09:25:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:32,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:32,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 09:25:32,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 09:25:32,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {616#true} {616#true} #34#return; {616#true} is VALID [2022-04-08 09:25:32,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:32,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 09:25:32,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 09:25:32,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #34#return; {616#true} is VALID [2022-04-08 09:25:32,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret5 := main(); {616#true} is VALID [2022-04-08 09:25:32,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#true} ~x~0 := 0;~y~0 := 1; {621#(= main_~x~0 0)} is VALID [2022-04-08 09:25:32,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:32,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:32,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {624#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-08 09:25:32,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {624#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 6); {617#false} is VALID [2022-04-08 09:25:32,360 INFO L272 TraceCheckUtils]: 10: Hoare triple {617#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {617#false} is VALID [2022-04-08 09:25:32,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {617#false} ~cond := #in~cond; {617#false} is VALID [2022-04-08 09:25:32,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {617#false} assume 0 == ~cond; {617#false} is VALID [2022-04-08 09:25:32,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {617#false} assume !false; {617#false} is VALID [2022-04-08 09:25:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336409874] [2022-04-08 09:25:32,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336409874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769482007] [2022-04-08 09:25:32,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:25:32,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:32,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:32,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:32,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:25:32,398 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:25:32,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:32,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 09:25:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:32,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:32,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {616#true} is VALID [2022-04-08 09:25:32,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 09:25:32,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 09:25:32,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #34#return; {616#true} is VALID [2022-04-08 09:25:32,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret5 := main(); {616#true} is VALID [2022-04-08 09:25:32,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#true} ~x~0 := 0;~y~0 := 1; {621#(= main_~x~0 0)} is VALID [2022-04-08 09:25:32,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:32,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:32,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:32,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {617#false} is VALID [2022-04-08 09:25:32,482 INFO L272 TraceCheckUtils]: 10: Hoare triple {617#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {617#false} is VALID [2022-04-08 09:25:32,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {617#false} ~cond := #in~cond; {617#false} is VALID [2022-04-08 09:25:32,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {617#false} assume 0 == ~cond; {617#false} is VALID [2022-04-08 09:25:32,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {617#false} assume !false; {617#false} is VALID [2022-04-08 09:25:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:32,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:32,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {617#false} assume !false; {617#false} is VALID [2022-04-08 09:25:32,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {672#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {617#false} is VALID [2022-04-08 09:25:32,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {676#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {672#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:25:32,697 INFO L272 TraceCheckUtils]: 10: Hoare triple {680#(= (mod main_~x~0 4294967296) 6)} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {676#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:32,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {684#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {680#(= (mod main_~x~0 4294967296) 6)} is VALID [2022-04-08 09:25:32,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {688#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {684#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} is VALID [2022-04-08 09:25:32,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {692#(or (< (mod (+ main_~x~0 2) 4294967296) 6) (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {688#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} is VALID [2022-04-08 09:25:32,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {696#(or (< (mod (+ main_~x~0 3) 4294967296) 6) (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {692#(or (< (mod (+ main_~x~0 2) 4294967296) 6) (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-08 09:25:32,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#true} ~x~0 := 0;~y~0 := 1; {696#(or (< (mod (+ main_~x~0 3) 4294967296) 6) (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-08 09:25:32,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret5 := main(); {616#true} is VALID [2022-04-08 09:25:32,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #34#return; {616#true} is VALID [2022-04-08 09:25:32,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 09:25:32,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 09:25:32,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {616#true} is VALID [2022-04-08 09:25:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:32,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769482007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:32,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:32,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 15 [2022-04-08 09:25:32,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:32,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535290286] [2022-04-08 09:25:32,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535290286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:32,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:32,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:25:32,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752824690] [2022-04-08 09:25:32,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:25:32,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:32,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:32,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:25:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:32,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:25:32,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:25:32,721 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:32,895 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:25:32,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:25:32,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:25:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 09:25:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 09:25:32,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-08 09:25:32,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:32,937 INFO L225 Difference]: With dead ends: 21 [2022-04-08 09:25:32,938 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:25:32,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:25:32,938 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:32,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:25:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:25:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 09:25:32,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:32,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,952 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,952 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:32,953 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:25:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:25:32,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:32,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:32,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:25:32,954 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:25:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:32,955 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:25:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:25:32,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:32,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:32,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:32,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:25:32,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 09:25:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:32,957 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:25:32,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:32,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:25:32,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:25:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:25:32,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:32,972 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:32,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:25:33,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:33,188 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-08 09:25:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:33,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98504870] [2022-04-08 09:25:33,192 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:33,192 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-08 09:25:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:33,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180043869] [2022-04-08 09:25:33,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:33,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 09:25:33,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 09:25:33,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {831#true} {831#true} #34#return; {831#true} is VALID [2022-04-08 09:25:33,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:33,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 09:25:33,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 09:25:33,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #34#return; {831#true} is VALID [2022-04-08 09:25:33,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret5 := main(); {831#true} is VALID [2022-04-08 09:25:33,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~x~0 := 0;~y~0 := 1; {836#(= main_~x~0 0)} is VALID [2022-04-08 09:25:33,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {837#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:33,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:33,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {839#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:33,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {839#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {840#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:25:33,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {840#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {832#false} is VALID [2022-04-08 09:25:33,311 INFO L272 TraceCheckUtils]: 11: Hoare triple {832#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {832#false} is VALID [2022-04-08 09:25:33,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {832#false} ~cond := #in~cond; {832#false} is VALID [2022-04-08 09:25:33,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {832#false} assume 0 == ~cond; {832#false} is VALID [2022-04-08 09:25:33,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-08 09:25:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:33,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180043869] [2022-04-08 09:25:33,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180043869] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:33,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20001573] [2022-04-08 09:25:33,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:25:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:33,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:33,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 09:25:33,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:25:33,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:33,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 09:25:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:33,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:33,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {831#true} is VALID [2022-04-08 09:25:33,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 09:25:33,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 09:25:33,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #34#return; {831#true} is VALID [2022-04-08 09:25:33,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret5 := main(); {831#true} is VALID [2022-04-08 09:25:33,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~x~0 := 0;~y~0 := 1; {836#(= main_~x~0 0)} is VALID [2022-04-08 09:25:33,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {837#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:33,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:33,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {839#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:33,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {839#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {872#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:25:33,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {872#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {832#false} is VALID [2022-04-08 09:25:33,472 INFO L272 TraceCheckUtils]: 11: Hoare triple {832#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {832#false} is VALID [2022-04-08 09:25:33,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {832#false} ~cond := #in~cond; {832#false} is VALID [2022-04-08 09:25:33,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {832#false} assume 0 == ~cond; {832#false} is VALID [2022-04-08 09:25:33,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-08 09:25:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:33,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:33,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-08 09:25:33,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {891#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {832#false} is VALID [2022-04-08 09:25:33,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {895#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {891#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:25:33,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {899#(= (mod main_~x~0 4294967296) 6)} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {895#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:33,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {903#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {899#(= (mod main_~x~0 4294967296) 6)} is VALID [2022-04-08 09:25:33,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {903#(or (= (mod main_~x~0 4294967296) 6) (< (mod main_~x~0 4294967296) 6))} is VALID [2022-04-08 09:25:33,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {911#(or (< (mod (+ main_~x~0 2) 4294967296) 6) (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {907#(or (= 6 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 6))} is VALID [2022-04-08 09:25:33,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(or (< (mod (+ main_~x~0 3) 4294967296) 6) (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {911#(or (< (mod (+ main_~x~0 2) 4294967296) 6) (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-08 09:25:33,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#(or (= (mod (+ main_~x~0 4) 4294967296) 6) (< (mod (+ main_~x~0 4) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {915#(or (< (mod (+ main_~x~0 3) 4294967296) 6) (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-08 09:25:33,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~x~0 := 0;~y~0 := 1; {919#(or (= (mod (+ main_~x~0 4) 4294967296) 6) (< (mod (+ main_~x~0 4) 4294967296) 6))} is VALID [2022-04-08 09:25:33,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret5 := main(); {831#true} is VALID [2022-04-08 09:25:33,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #34#return; {831#true} is VALID [2022-04-08 09:25:33,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 09:25:33,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 09:25:33,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {831#true} is VALID [2022-04-08 09:25:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:33,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20001573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:33,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:33,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2022-04-08 09:25:33,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:33,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98504870] [2022-04-08 09:25:33,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98504870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:33,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:33,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:25:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784575537] [2022-04-08 09:25:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:25:33,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:33,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:33,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:25:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:33,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:25:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:25:33,765 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:33,934 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:25:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:25:33,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:25:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:25:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:25:33,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-08 09:25:33,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:33,960 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:25:33,960 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:25:33,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:25:33,961 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:33,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:25:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:25:33,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:33,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,973 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,974 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:33,974 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:25:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:25:33,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:33,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:33,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:25:33,975 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:25:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:33,976 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:25:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:25:33,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:33,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:33,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:33,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:25:33,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 09:25:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:33,978 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:25:33,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:33,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:25:33,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:25:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:25:33,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:33,996 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:34,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 09:25:34,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:34,207 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-08 09:25:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:34,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103185529] [2022-04-08 09:25:34,211 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:34,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-08 09:25:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:34,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658604391] [2022-04-08 09:25:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:34,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {1073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1062#true} is VALID [2022-04-08 09:25:34,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1062#true} assume true; {1062#true} is VALID [2022-04-08 09:25:34,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1062#true} {1062#true} #34#return; {1062#true} is VALID [2022-04-08 09:25:34,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {1062#true} call ULTIMATE.init(); {1073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:34,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1062#true} is VALID [2022-04-08 09:25:34,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1062#true} assume true; {1062#true} is VALID [2022-04-08 09:25:34,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1062#true} {1062#true} #34#return; {1062#true} is VALID [2022-04-08 09:25:34,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1062#true} call #t~ret5 := main(); {1062#true} is VALID [2022-04-08 09:25:34,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1062#true} ~x~0 := 0;~y~0 := 1; {1067#(= main_~x~0 0)} is VALID [2022-04-08 09:25:34,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1068#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:34,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {1068#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1069#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:34,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1070#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:34,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1071#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:25:34,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1072#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-08 09:25:34,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1063#false} is VALID [2022-04-08 09:25:34,369 INFO L272 TraceCheckUtils]: 12: Hoare triple {1063#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {1063#false} is VALID [2022-04-08 09:25:34,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {1063#false} ~cond := #in~cond; {1063#false} is VALID [2022-04-08 09:25:34,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {1063#false} assume 0 == ~cond; {1063#false} is VALID [2022-04-08 09:25:34,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {1063#false} assume !false; {1063#false} is VALID [2022-04-08 09:25:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:34,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658604391] [2022-04-08 09:25:34,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658604391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:34,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920194303] [2022-04-08 09:25:34,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:25:34,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:34,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:34,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:34,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 09:25:34,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:25:34,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:34,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 09:25:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:34,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:34,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {1062#true} call ULTIMATE.init(); {1062#true} is VALID [2022-04-08 09:25:34,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {1062#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1062#true} is VALID [2022-04-08 09:25:34,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {1062#true} assume true; {1062#true} is VALID [2022-04-08 09:25:34,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1062#true} {1062#true} #34#return; {1062#true} is VALID [2022-04-08 09:25:34,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {1062#true} call #t~ret5 := main(); {1062#true} is VALID [2022-04-08 09:25:34,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {1062#true} ~x~0 := 0;~y~0 := 1; {1067#(= main_~x~0 0)} is VALID [2022-04-08 09:25:34,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1068#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:34,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {1068#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1069#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:34,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1070#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:34,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1071#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:25:34,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:25:34,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1063#false} is VALID [2022-04-08 09:25:34,631 INFO L272 TraceCheckUtils]: 12: Hoare triple {1063#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {1063#false} is VALID [2022-04-08 09:25:34,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {1063#false} ~cond := #in~cond; {1063#false} is VALID [2022-04-08 09:25:34,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1063#false} assume 0 == ~cond; {1063#false} is VALID [2022-04-08 09:25:34,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {1063#false} assume !false; {1063#false} is VALID [2022-04-08 09:25:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:34,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:34,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {1063#false} assume !false; {1063#false} is VALID [2022-04-08 09:25:34,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1063#false} assume 0 == ~cond; {1063#false} is VALID [2022-04-08 09:25:34,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {1063#false} ~cond := #in~cond; {1063#false} is VALID [2022-04-08 09:25:34,765 INFO L272 TraceCheckUtils]: 12: Hoare triple {1063#false} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {1063#false} is VALID [2022-04-08 09:25:34,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1135#(< (mod main_~x~0 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {1063#false} is VALID [2022-04-08 09:25:34,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {1139#(< (mod (+ main_~x~0 1) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1135#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-08 09:25:34,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {1143#(< (mod (+ main_~x~0 2) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1139#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-08 09:25:34,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {1147#(< (mod (+ main_~x~0 3) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1143#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-08 09:25:34,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#(< (mod (+ main_~x~0 4) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1147#(< (mod (+ main_~x~0 3) 4294967296) 6)} is VALID [2022-04-08 09:25:34,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {1155#(< (mod (+ 5 main_~x~0) 4294967296) 6)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1151#(< (mod (+ main_~x~0 4) 4294967296) 6)} is VALID [2022-04-08 09:25:34,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1062#true} ~x~0 := 0;~y~0 := 1; {1155#(< (mod (+ 5 main_~x~0) 4294967296) 6)} is VALID [2022-04-08 09:25:34,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1062#true} call #t~ret5 := main(); {1062#true} is VALID [2022-04-08 09:25:34,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1062#true} {1062#true} #34#return; {1062#true} is VALID [2022-04-08 09:25:34,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {1062#true} assume true; {1062#true} is VALID [2022-04-08 09:25:34,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {1062#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1062#true} is VALID [2022-04-08 09:25:34,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {1062#true} call ULTIMATE.init(); {1062#true} is VALID [2022-04-08 09:25:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:34,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920194303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:34,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:34,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 09:25:34,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:34,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103185529] [2022-04-08 09:25:34,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103185529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:34,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:34,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:25:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239938221] [2022-04-08 09:25:34,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:34,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:25:34,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:34,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:34,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:34,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:25:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:34,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:25:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:25:34,793 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:34,994 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:25:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:25:34,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 09:25:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 09:25:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 09:25:34,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-08 09:25:35,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:35,018 INFO L225 Difference]: With dead ends: 23 [2022-04-08 09:25:35,018 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 09:25:35,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:25:35,019 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:35,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:25:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 09:25:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 09:25:35,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:35,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:35,034 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:35,034 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:35,035 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:25:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:25:35,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:35,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:35,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 09:25:35,036 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 09:25:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:35,037 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:25:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:25:35,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:35,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:35,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:35,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 09:25:35,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 09:25:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:35,039 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 09:25:35,039 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:35,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 09:25:35,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:25:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:25:35,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:35,058 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:35,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 09:25:35,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:35,272 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-08 09:25:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:35,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051855172] [2022-04-08 09:25:35,276 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:35,276 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-08 09:25:35,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:35,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230963249] [2022-04-08 09:25:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:35,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:35,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1306#true} is VALID [2022-04-08 09:25:35,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 09:25:35,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #34#return; {1306#true} is VALID [2022-04-08 09:25:35,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:35,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1306#true} is VALID [2022-04-08 09:25:35,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 09:25:35,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #34#return; {1306#true} is VALID [2022-04-08 09:25:35,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret5 := main(); {1306#true} is VALID [2022-04-08 09:25:35,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} ~x~0 := 0;~y~0 := 1; {1311#(= main_~x~0 0)} is VALID [2022-04-08 09:25:35,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {1311#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1312#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:35,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1312#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1313#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:35,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {1313#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1314#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:35,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {1314#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1315#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:25:35,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {1315#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1316#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 09:25:35,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {1316#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1317#(and (<= main_~x~0 (+ 6 (* 4294967296 (div main_~x~0 4294967296)))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:25:35,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {1317#(and (<= main_~x~0 (+ 6 (* 4294967296 (div main_~x~0 4294967296)))) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {1318#(and (<= main_~x~0 (+ 6 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-08 09:25:35,499 INFO L272 TraceCheckUtils]: 13: Hoare triple {1318#(and (<= main_~x~0 (+ 6 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:25:35,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1320#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:25:35,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {1320#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 09:25:35,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 09:25:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:35,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230963249] [2022-04-08 09:25:35,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230963249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:35,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591668928] [2022-04-08 09:25:35,502 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:25:35,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:35,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:35,503 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:25:35,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 09:25:35,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:25:35,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:35,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:25:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:35,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:36,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #34#return; {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret5 := main(); {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} ~x~0 := 0;~y~0 := 1; {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1306#true} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1306#true} is VALID [2022-04-08 09:25:36,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1306#true} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1306#true} is VALID [2022-04-08 09:25:36,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {1306#true} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1306#true} is VALID [2022-04-08 09:25:36,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#true} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1306#true} is VALID [2022-04-08 09:25:36,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {1306#true} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1358#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} is VALID [2022-04-08 09:25:36,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {1358#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {1362#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (not (< (mod main_~x~0 4294967296) 6)))} is VALID [2022-04-08 09:25:36,093 INFO L272 TraceCheckUtils]: 13: Hoare triple {1362#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (not (< (mod main_~x~0 4294967296) 6)))} call __VERIFIER_assert((if 6 == ~x~0 % 4294967296 then 1 else 0)); {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:36,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:36,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {1370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 09:25:36,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 09:25:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 09:25:36,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:25:36,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591668928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:36,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:25:36,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-04-08 09:25:36,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:36,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051855172] [2022-04-08 09:25:36,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051855172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:36,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:36,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:25:36,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740017416] [2022-04-08 09:25:36,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:36,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:25:36,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:36,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:36,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:36,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:25:36,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:36,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:25:36,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:25:36,110 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:36,201 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:25:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:25:36,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:25:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-08 09:25:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-08 09:25:36,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-04-08 09:25:36,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:36,216 INFO L225 Difference]: With dead ends: 18 [2022-04-08 09:25:36,216 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:25:36,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:25:36,217 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:36,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:25:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:25:36,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:36,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:36,218 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:36,218 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:36,218 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:25:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:25:36,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:36,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:36,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:25:36,219 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:25:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:36,219 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:25:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:25:36,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:36,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:36,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:36,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:25:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:25:36,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-08 09:25:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:36,220 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:25:36,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:25:36,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:25:36,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:25:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:25:36,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:36,223 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:25:36,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 09:25:36,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:36,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:25:36,501 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 09:25:36,501 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 09:25:36,501 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 09:25:36,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:25:36,501 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:25:36,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:25:36,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:25:36,501 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:25:36,501 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 22) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 12 22) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 16 19) the Hoare annotation is: (or (= main_~x~0 0) (< (mod (+ main_~x~0 4294967295) 4294967296) 6)) [2022-04-08 09:25:36,502 INFO L878 garLoopResultBuilder]: At program point L16-3(lines 16 19) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (not (< (mod main_~x~0 4294967296) 6))) [2022-04-08 09:25:36,502 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 12 22) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 09:25:36,502 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 09:25:36,502 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-08 09:25:36,502 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 09:25:36,505 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-08 09:25:36,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:25:36,509 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:25:36,510 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:25:36,515 INFO L163 areAnnotationChecker]: CFG has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:25:36,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:25:36 BoogieIcfgContainer [2022-04-08 09:25:36,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:25:36,523 INFO L158 Benchmark]: Toolchain (without parser) took 7239.34ms. Allocated memory was 200.3MB in the beginning and 251.7MB in the end (delta: 51.4MB). Free memory was 150.7MB in the beginning and 163.2MB in the end (delta: -12.5MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. [2022-04-08 09:25:36,523 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 200.3MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:25:36,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.63ms. Allocated memory is still 200.3MB. Free memory was 150.6MB in the beginning and 177.9MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:25:36,524 INFO L158 Benchmark]: Boogie Preprocessor took 37.96ms. Allocated memory is still 200.3MB. Free memory was 177.9MB in the beginning and 176.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:25:36,524 INFO L158 Benchmark]: RCFGBuilder took 265.31ms. Allocated memory is still 200.3MB. Free memory was 176.4MB in the beginning and 166.8MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 09:25:36,524 INFO L158 Benchmark]: TraceAbstraction took 6723.85ms. Allocated memory was 200.3MB in the beginning and 251.7MB in the end (delta: 51.4MB). Free memory was 166.0MB in the beginning and 163.2MB in the end (delta: 2.8MB). Peak memory consumption was 55.5MB. Max. memory is 8.0GB. [2022-04-08 09:25:36,525 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.15ms. Allocated memory is still 200.3MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.63ms. Allocated memory is still 200.3MB. Free memory was 150.6MB in the beginning and 177.9MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.96ms. Allocated memory is still 200.3MB. Free memory was 177.9MB in the beginning and 176.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.31ms. Allocated memory is still 200.3MB. Free memory was 176.4MB in the beginning and 166.8MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6723.85ms. Allocated memory was 200.3MB in the beginning and 251.7MB in the end (delta: 51.4MB). Free memory was 166.0MB in the beginning and 163.2MB in the end (delta: 2.8MB). Peak memory consumption was 55.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 91 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 60 PreInvPairs, 85 NumberOfFragments, 60 HoareAnnotationTreeSize, 60 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 111 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: x == 0 || (x + 4294967295) % 4294967296 < 6 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:25:36,539 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...