/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_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:25:08,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:25:08,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:25:08,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:25:08,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:25:08,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:25:08,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:25:08,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:25:08,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:25:08,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:25:08,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:25:08,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:25:08,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:25:08,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:25:08,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:25:08,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:25:08,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:25:08,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:25:08,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:25:08,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:25:08,614 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:25:08,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:25:08,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:25:08,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:25:08,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:25:08,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:25:08,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:25:08,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:25:08,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:25:08,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:25:08,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:25:08,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:25:08,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:25:08,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:25:08,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:25:08,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:25:08,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:25:08,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:25:08,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:25:08,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:25:08,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:25:08,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:25:08,628 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:08,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:25:08,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:25:08,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:25:08,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:25:08,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:25:08,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:25:08,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:25:08,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:25:08,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:25:08,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:25:08,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:25:08,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:25:08,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:25:08,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:25:08,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:25:08,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:08,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:25:08,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:25:08,640 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:25:08,640 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:25:08,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:25:08,640 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:25:08,641 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:08,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:25:08,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:25:08,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:25:08,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:25:08,875 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:25:08,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-08 09:25:08,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120d89b76/a0c16a1c1fb7411ab7e7d4e9209e9e55/FLAGa24e859bd [2022-04-08 09:25:09,247 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:25:09,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-08 09:25:09,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120d89b76/a0c16a1c1fb7411ab7e7d4e9209e9e55/FLAGa24e859bd [2022-04-08 09:25:09,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120d89b76/a0c16a1c1fb7411ab7e7d4e9209e9e55 [2022-04-08 09:25:09,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:25:09,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:25:09,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:09,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:25:09,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:25:09,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:09" (1/1) ... [2022-04-08 09:25:09,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0bb8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:09, skipping insertion in model container [2022-04-08 09:25:09,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:25:09" (1/1) ... [2022-04-08 09:25:09,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:25:09,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:25:09,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c[327,340] [2022-04-08 09:25:09,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:09,857 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:25:09,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c[327,340] [2022-04-08 09:25:09,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:25:09,879 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:25:09,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:09 WrapperNode [2022-04-08 09:25:09,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:25:09,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:25:09,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:25:09,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:25:09,890 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:09" (1/1) ... [2022-04-08 09:25:09,890 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:09" (1/1) ... [2022-04-08 09:25:09,897 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:09" (1/1) ... [2022-04-08 09:25:09,897 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:09" (1/1) ... [2022-04-08 09:25:09,903 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:09" (1/1) ... [2022-04-08 09:25:09,907 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:09" (1/1) ... [2022-04-08 09:25:09,913 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:09" (1/1) ... [2022-04-08 09:25:09,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:25:09,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:25:09,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:25:09,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:25:09,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:09" (1/1) ... [2022-04-08 09:25:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:25:09,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:09,943 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:09,968 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:09,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:25:09,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:25:09,984 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:25:09,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:25:09,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:25:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:25:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:25:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:25:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:25:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:25:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:25:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:25:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:25:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:25:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:25:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:25:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:25:10,045 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:25:10,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:25:10,146 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:25:10,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:25:10,154 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:25:10,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:10 BoogieIcfgContainer [2022-04-08 09:25:10,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:25:10,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:25:10,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:25:10,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:25:10,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:25:09" (1/3) ... [2022-04-08 09:25:10,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b9c9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:10, skipping insertion in model container [2022-04-08 09:25:10,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:25:09" (2/3) ... [2022-04-08 09:25:10,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b9c9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:25:10, skipping insertion in model container [2022-04-08 09:25:10,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:25:10" (3/3) ... [2022-04-08 09:25:10,164 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-1.c [2022-04-08 09:25:10,171 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:25:10,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:25:10,219 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:25:10,223 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:10,223 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:25:10,237 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:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:25:10,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:10,243 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:10,244 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-08 09:25:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:10,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833360011] [2022-04-08 09:25:10,262 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:25:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-08 09:25:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:10,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400349935] [2022-04-08 09:25:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:10,382 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:10,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:25:10,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-08 09:25:10,384 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:10,384 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:10,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 09:25:10,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-08 09:25:10,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-08 09:25:10,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-08 09:25:10,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-08 09:25:10,386 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-08 09:25:10,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-08 09:25:10,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-08 09:25:10,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-08 09:25:10,387 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:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:10,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400349935] [2022-04-08 09:25:10,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400349935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:10,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:10,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:25:10,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:10,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833360011] [2022-04-08 09:25:10,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833360011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:10,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:10,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:25:10,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082633534] [2022-04-08 09:25:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:10,396 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:10,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:10,400 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:10,415 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:10,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:25:10,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:10,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:25:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:25:10,440 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:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:10,551 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 09:25:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:25:10,552 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:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:10,553 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:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-08 09:25:10,559 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:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-08 09:25:10,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-08 09:25:10,620 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:10,628 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:25:10,628 INFO L226 Difference]: Without dead ends: 12 [2022-04-08 09:25:10,630 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:10,633 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:10,634 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:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-08 09:25:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-08 09:25:10,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:10,660 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:10,661 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:10,662 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:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:10,664 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-08 09:25:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 09:25:10,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:10,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:10,665 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:10,665 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:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:10,667 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-08 09:25:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 09:25:10,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:10,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:10,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:10,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:10,668 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:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-08 09:25:10,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-08 09:25:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:10,671 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-08 09:25:10,671 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:10,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-08 09:25:10,686 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:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-08 09:25:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:25:10,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:10,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:10,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:25:10,688 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-08 09:25:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:10,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373063181] [2022-04-08 09:25:10,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:25:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-08 09:25:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:10,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451245967] [2022-04-08 09:25:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:10,776 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:10,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-08 09:25:10,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-08 09:25:10,778 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:10,778 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:10,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-08 09:25:10,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-08 09:25:10,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-08 09:25:10,781 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:10,782 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:10,782 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-08 09:25:10,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-08 09:25:10,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-08 09:25:10,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-08 09:25:10,783 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:10,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:10,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451245967] [2022-04-08 09:25:10,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451245967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:10,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:10,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:10,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:10,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373063181] [2022-04-08 09:25:10,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373063181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:10,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:10,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:25:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646847916] [2022-04-08 09:25:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:10,788 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:10,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:10,789 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:10,804 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:10,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:25:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:25:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:25:10,806 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:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:10,884 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:25:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:25:10,884 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:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:10,885 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:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-08 09:25:10,886 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:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-08 09:25:10,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-08 09:25:10,918 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:10,921 INFO L225 Difference]: With dead ends: 18 [2022-04-08 09:25:10,921 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 09:25:10,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:25:10,925 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:10,926 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:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 09:25:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 09:25:10,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:10,936 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:10,937 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:10,938 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:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:10,941 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:25:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:25:10,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:10,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:10,943 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:10,943 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:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:10,944 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:25:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:25:10,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:10,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:10,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:10,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:10,945 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:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 09:25:10,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 09:25:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:10,946 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 09:25:10,946 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:10,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 09:25:10,966 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:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:25:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:25:10,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:10,967 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:10,968 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:25:10,968 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-08 09:25:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481239358] [2022-04-08 09:25:10,997 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:10,997 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-08 09:25:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:10,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834945477] [2022-04-08 09:25:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:11,113 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:11,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:11,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:11,114 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:11,114 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:11,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:11,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:11,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 09:25:11,115 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:11,116 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:11,116 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:11,117 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-08 09:25:11,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-08 09:25:11,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-08 09:25:11,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 09:25:11,118 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:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:11,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834945477] [2022-04-08 09:25:11,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834945477] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:11,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781051200] [2022-04-08 09:25:11,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:25:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:11,120 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:11,129 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:11,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:25:11,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:11,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:25:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:11,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:11,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-08 09:25:11,284 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:11,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:11,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:11,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 09:25:11,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {260#(= main_~y~0 1)} is VALID [2022-04-08 09:25:11,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {264#(= main_~y~0 2)} is VALID [2022-04-08 09:25:11,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(= main_~y~0 2)} assume !(~x~0 % 4294967296 < 6); {264#(= main_~y~0 2)} is VALID [2022-04-08 09:25:11,293 INFO L272 TraceCheckUtils]: 8: Hoare triple {264#(= main_~y~0 2)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:11,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:11,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {235#false} is VALID [2022-04-08 09:25:11,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 09:25:11,294 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:11,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:11,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-08 09:25:11,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {235#false} is VALID [2022-04-08 09:25:11,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:11,450 INFO L272 TraceCheckUtils]: 8: Hoare triple {291#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:11,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {291#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:11,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {291#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:11,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {298#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 09:25:11,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-08 09:25:11,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-08 09:25:11,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-08 09:25:11,455 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:11,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-08 09:25:11,456 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:11,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781051200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:11,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:11,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-08 09:25:11,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:11,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481239358] [2022-04-08 09:25:11,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481239358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:11,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:11,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:25:11,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549774823] [2022-04-08 09:25:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:11,459 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:11,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:11,460 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:11,469 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:11,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:25:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:11,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:25:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:25:11,470 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:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:11,537 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:25:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:25:11,538 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:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:11,539 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:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 09:25:11,541 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:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-08 09:25:11,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-08 09:25:11,566 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:11,568 INFO L225 Difference]: With dead ends: 19 [2022-04-08 09:25:11,568 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:25:11,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:25:11,575 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:11,579 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:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:25:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:25:11,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:11,585 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:11,585 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:11,585 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:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:11,586 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:25:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:25:11,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:11,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:11,587 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:11,588 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:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:11,589 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:25:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:25:11,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:11,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:11,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:11,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:11,591 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:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 09:25:11,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-08 09:25:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:11,593 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 09:25:11,593 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:11,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 09:25:11,606 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:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:25:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:25:11,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:11,606 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:11,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:25:11,815 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:11,816 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-08 09:25:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:11,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [120637369] [2022-04-08 09:25:11,820 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:11,820 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-08 09:25:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:11,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667262909] [2022-04-08 09:25:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:11,957 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:11,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:11,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:11,961 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:11,961 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:11,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:11,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:11,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 09:25:11,962 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:11,963 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:11,964 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:11,964 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:11,964 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-08 09:25:11,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-08 09:25:11,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-08 09:25:11,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 09:25:11,965 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:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667262909] [2022-04-08 09:25:11,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667262909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:11,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221360485] [2022-04-08 09:25:11,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:25:11,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:11,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:11,967 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:12,004 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:12,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:25:12,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:12,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:25:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:12,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:12,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 09:25:12,119 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:12,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:12,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:12,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 09:25:12,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {444#(= main_~y~0 1)} is VALID [2022-04-08 09:25:12,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {448#(= main_~y~0 2)} is VALID [2022-04-08 09:25:12,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {448#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {452#(= main_~y~0 4)} is VALID [2022-04-08 09:25:12,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#(= main_~y~0 4)} assume !(~x~0 % 4294967296 < 6); {452#(= main_~y~0 4)} is VALID [2022-04-08 09:25:12,123 INFO L272 TraceCheckUtils]: 9: Hoare triple {452#(= main_~y~0 4)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:12,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:12,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {418#false} is VALID [2022-04-08 09:25:12,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 09:25:12,124 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:12,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:12,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 09:25:12,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {418#false} is VALID [2022-04-08 09:25:12,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:12,305 INFO L272 TraceCheckUtils]: 9: Hoare triple {479#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:12,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {479#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:12,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {479#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:12,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {486#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 09:25:12,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 0;~y~0 := 1; {490#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 09:25:12,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret5 := main(); {417#true} is VALID [2022-04-08 09:25:12,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-08 09:25:12,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-08 09:25:12,309 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:12,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 09:25:12,310 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:12,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221360485] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:12,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:12,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-04-08 09:25:12,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:12,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [120637369] [2022-04-08 09:25:12,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [120637369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:12,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:12,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:25:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313148072] [2022-04-08 09:25:12,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:12,311 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:12,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:12,312 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:12,322 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:12,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:25:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:12,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:25:12,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:25:12,323 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:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:12,411 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 09:25:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:25:12,411 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:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:12,411 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:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 09:25:12,412 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:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 09:25:12,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 09:25:12,432 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:12,433 INFO L225 Difference]: With dead ends: 20 [2022-04-08 09:25:12,433 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:25:12,433 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:25:12,434 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:12,434 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:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:25:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:25:12,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:12,441 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:12,441 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:12,441 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:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:12,444 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:25:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:25:12,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:12,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:12,445 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:12,445 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:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:12,446 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:25:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:25:12,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:12,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:12,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:12,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:12,447 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:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:25:12,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 09:25:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:12,448 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:25:12,448 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:12,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:25:12,461 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:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:25:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:25:12,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:12,461 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:12,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 09:25:12,661 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:12,662 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-08 09:25:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:12,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465029014] [2022-04-08 09:25:12,672 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:12,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-08 09:25:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:12,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823987524] [2022-04-08 09:25:12,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:12,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:12,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {617#true} is VALID [2022-04-08 09:25:12,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 09:25:12,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 09:25:12,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:12,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {617#true} is VALID [2022-04-08 09:25:12,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 09:25:12,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 09:25:12,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret5 := main(); {617#true} is VALID [2022-04-08 09:25:12,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#true} ~x~0 := 0;~y~0 := 1; {622#(= main_~x~0 0)} is VALID [2022-04-08 09:25:12,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {622#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {623#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:12,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:12,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-08 09:25:12,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 6); {618#false} is VALID [2022-04-08 09:25:12,788 INFO L272 TraceCheckUtils]: 10: Hoare triple {618#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {618#false} is VALID [2022-04-08 09:25:12,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {618#false} ~cond := #in~cond; {618#false} is VALID [2022-04-08 09:25:12,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#false} assume 0 == ~cond; {618#false} is VALID [2022-04-08 09:25:12,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#false} assume !false; {618#false} is VALID [2022-04-08 09:25:12,789 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:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:12,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823987524] [2022-04-08 09:25:12,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823987524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:12,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826234798] [2022-04-08 09:25:12,789 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:25:12,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:12,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:12,802 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:12,804 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:12,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:25:12,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:12,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 09:25:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:12,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:12,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {617#true} is VALID [2022-04-08 09:25:12,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {617#true} is VALID [2022-04-08 09:25:12,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 09:25:12,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 09:25:12,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret5 := main(); {617#true} is VALID [2022-04-08 09:25:12,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#true} ~x~0 := 0;~y~0 := 1; {645#(= main_~y~0 1)} is VALID [2022-04-08 09:25:12,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {645#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {649#(= main_~y~0 2)} is VALID [2022-04-08 09:25:12,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {653#(= main_~y~0 4)} is VALID [2022-04-08 09:25:12,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(= main_~y~0 4)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {657#(= main_~y~0 8)} is VALID [2022-04-08 09:25:12,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(= main_~y~0 8)} assume !(~x~0 % 4294967296 < 6); {657#(= main_~y~0 8)} is VALID [2022-04-08 09:25:12,963 INFO L272 TraceCheckUtils]: 10: Hoare triple {657#(= main_~y~0 8)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:12,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:12,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {618#false} is VALID [2022-04-08 09:25:12,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#false} assume !false; {618#false} is VALID [2022-04-08 09:25:12,965 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:12,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:13,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#false} assume !false; {618#false} is VALID [2022-04-08 09:25:13,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {618#false} is VALID [2022-04-08 09:25:13,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:13,131 INFO L272 TraceCheckUtils]: 10: Hoare triple {684#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:13,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {684#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {684#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:13,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {691#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {684#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:13,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {691#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 09:25:13,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#(not (= (mod (* main_~y~0 8) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {695#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 09:25:13,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#true} ~x~0 := 0;~y~0 := 1; {699#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-08 09:25:13,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {617#true} call #t~ret5 := main(); {617#true} is VALID [2022-04-08 09:25:13,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {617#true} {617#true} #34#return; {617#true} is VALID [2022-04-08 09:25:13,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {617#true} assume true; {617#true} is VALID [2022-04-08 09:25:13,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {617#true} is VALID [2022-04-08 09:25:13,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {617#true} call ULTIMATE.init(); {617#true} is VALID [2022-04-08 09:25:13,139 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:13,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826234798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:13,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:13,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-04-08 09:25:13,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:13,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465029014] [2022-04-08 09:25:13,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465029014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:13,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:13,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:25:13,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323885488] [2022-04-08 09:25:13,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:13,141 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:13,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:13,141 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:13,153 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:13,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:25:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:13,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:25:13,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:25:13,155 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:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:13,295 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:25:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:25:13,296 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:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:13,296 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:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 09:25:13,297 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:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-08 09:25:13,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-08 09:25:13,316 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:13,317 INFO L225 Difference]: With dead ends: 21 [2022-04-08 09:25:13,317 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:25:13,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:25:13,318 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:13,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:25:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 09:25:13,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:13,326 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:13,326 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:13,326 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:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:13,327 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:25:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:25:13,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:13,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:13,328 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:13,328 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:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:13,329 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:25:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:25:13,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:13,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:13,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:13,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:13,330 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:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:25:13,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 09:25:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:13,331 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:25:13,331 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:13,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:25:13,345 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:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:25:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:25:13,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:13,346 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:13,371 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:13,568 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:13,569 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-08 09:25:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:13,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360614824] [2022-04-08 09:25:13,573 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:13,573 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-08 09:25:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:13,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324143745] [2022-04-08 09:25:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:13,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {834#true} is VALID [2022-04-08 09:25:13,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 09:25:13,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 09:25:13,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:13,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {834#true} is VALID [2022-04-08 09:25:13,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 09:25:13,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 09:25:13,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret5 := main(); {834#true} is VALID [2022-04-08 09:25:13,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} ~x~0 := 0;~y~0 := 1; {839#(= main_~x~0 0)} is VALID [2022-04-08 09:25:13,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {839#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {840#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:13,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {841#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:13,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {842#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:13,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {843#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:25:13,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {843#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {835#false} is VALID [2022-04-08 09:25:13,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {835#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {835#false} is VALID [2022-04-08 09:25:13,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {835#false} ~cond := #in~cond; {835#false} is VALID [2022-04-08 09:25:13,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {835#false} assume 0 == ~cond; {835#false} is VALID [2022-04-08 09:25:13,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-08 09:25:13,679 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:13,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324143745] [2022-04-08 09:25:13,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324143745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:13,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3373474] [2022-04-08 09:25:13,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:25:13,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:13,681 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:13,706 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:13,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:25:13,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:13,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 09:25:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:13,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:13,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-08 09:25:13,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {834#true} is VALID [2022-04-08 09:25:13,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 09:25:13,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 09:25:13,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret5 := main(); {834#true} is VALID [2022-04-08 09:25:13,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} ~x~0 := 0;~y~0 := 1; {863#(= main_~y~0 1)} is VALID [2022-04-08 09:25:13,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {867#(= main_~y~0 2)} is VALID [2022-04-08 09:25:13,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {871#(= main_~y~0 4)} is VALID [2022-04-08 09:25:13,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(= main_~y~0 4)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {875#(= main_~y~0 8)} is VALID [2022-04-08 09:25:13,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#(= main_~y~0 8)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {879#(= main_~y~0 16)} is VALID [2022-04-08 09:25:13,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(= main_~y~0 16)} assume !(~x~0 % 4294967296 < 6); {879#(= main_~y~0 16)} is VALID [2022-04-08 09:25:13,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {879#(= main_~y~0 16)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:13,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:13,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-08 09:25:13,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-08 09:25:13,846 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:13,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:14,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-08 09:25:14,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-08 09:25:14,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:14,051 INFO L272 TraceCheckUtils]: 11: Hoare triple {906#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:14,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {906#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:14,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {906#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:14,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {913#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 09:25:14,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(not (= (mod (* main_~y~0 8) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {917#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 09:25:14,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {921#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-08 09:25:14,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} ~x~0 := 0;~y~0 := 1; {925#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} is VALID [2022-04-08 09:25:14,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret5 := main(); {834#true} is VALID [2022-04-08 09:25:14,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #34#return; {834#true} is VALID [2022-04-08 09:25:14,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-08 09:25:14,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {834#true} is VALID [2022-04-08 09:25:14,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-08 09:25:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:25:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3373474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:14,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2022-04-08 09:25:14,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:14,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1360614824] [2022-04-08 09:25:14,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1360614824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:14,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:14,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:25:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611825773] [2022-04-08 09:25:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:14,058 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:14,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:14,059 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:14,082 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:14,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:25:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:25:14,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:25:14,083 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:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:14,263 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:25:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:25:14,263 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:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:14,264 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:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:25:14,264 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:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-08 09:25:14,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-08 09:25:14,290 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:14,291 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:25:14,291 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:25:14,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:25:14,292 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:14,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:25:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:25:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:25:14,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:14,301 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:14,301 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:14,301 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:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:14,303 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:25:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:25:14,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:14,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:14,305 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:14,305 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:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:14,306 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:25:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:25:14,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:14,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:14,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:14,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:14,308 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:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:25:14,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 09:25:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:14,309 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:25:14,309 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:14,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:25:14,326 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:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:25:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:25:14,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:14,330 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:14,356 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:14,539 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:14,539 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-08 09:25:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:14,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028123997] [2022-04-08 09:25:14,543 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:14,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-08 09:25:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:14,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169219762] [2022-04-08 09:25:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:25:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:14,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {1079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-08 09:25:14,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 09:25:14,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 09:25:14,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:25:14,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-08 09:25:14,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 09:25:14,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 09:25:14,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-08 09:25:14,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1073#(= main_~x~0 0)} is VALID [2022-04-08 09:25:14,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:25:14,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:25:14,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:25:14,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:25:14,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-08 09:25:14,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1069#false} is VALID [2022-04-08 09:25:14,657 INFO L272 TraceCheckUtils]: 12: Hoare triple {1069#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {1069#false} is VALID [2022-04-08 09:25:14,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {1069#false} ~cond := #in~cond; {1069#false} is VALID [2022-04-08 09:25:14,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {1069#false} assume 0 == ~cond; {1069#false} is VALID [2022-04-08 09:25:14,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-08 09:25:14,658 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:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:25:14,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169219762] [2022-04-08 09:25:14,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169219762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:25:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452500488] [2022-04-08 09:25:14,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:25:14,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:25:14,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:25:14,663 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:14,665 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:14,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:25:14,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:25:14,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 09:25:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:25:14,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:25:14,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-08 09:25:14,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-08 09:25:14,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 09:25:14,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 09:25:14,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-08 09:25:14,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1098#(= main_~y~0 1)} is VALID [2022-04-08 09:25:14,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1102#(= main_~y~0 2)} is VALID [2022-04-08 09:25:14,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1106#(= main_~y~0 4)} is VALID [2022-04-08 09:25:14,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {1106#(= main_~y~0 4)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1110#(= main_~y~0 8)} is VALID [2022-04-08 09:25:14,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#(= main_~y~0 8)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1114#(= main_~y~0 16)} is VALID [2022-04-08 09:25:14,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {1114#(= main_~y~0 16)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1118#(= 32 main_~y~0)} is VALID [2022-04-08 09:25:14,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {1118#(= 32 main_~y~0)} assume !(~x~0 % 4294967296 < 6); {1118#(= 32 main_~y~0)} is VALID [2022-04-08 09:25:14,855 INFO L272 TraceCheckUtils]: 12: Hoare triple {1118#(= 32 main_~y~0)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:14,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:14,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1069#false} is VALID [2022-04-08 09:25:14,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-08 09:25:14,856 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:14,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:25:15,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-08 09:25:15,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1069#false} is VALID [2022-04-08 09:25:15,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:25:15,121 INFO L272 TraceCheckUtils]: 12: Hoare triple {1145#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {1125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:25:15,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {1145#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:15,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1145#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 09:25:15,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1152#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-08 09:25:15,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(not (= (mod (* main_~y~0 8) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1156#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-08 09:25:15,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {1164#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1160#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-08 09:25:15,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1168#(not (= 64 (mod (* 32 main_~y~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1164#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} is VALID [2022-04-08 09:25:15,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1168#(not (= 64 (mod (* 32 main_~y~0) 4294967296)))} is VALID [2022-04-08 09:25:15,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-08 09:25:15,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-08 09:25:15,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-08 09:25:15,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-08 09:25:15,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-08 09:25:15,133 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:15,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452500488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:25:15,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:25:15,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2022-04-08 09:25:15,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:25:15,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028123997] [2022-04-08 09:25:15,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028123997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:25:15,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:25:15,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:25:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153928076] [2022-04-08 09:25:15,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:25:15,134 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:15,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:25:15,134 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:15,146 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:15,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:25:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:15,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:25:15,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:25:15,147 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:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:15,393 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:25:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:25:15,393 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:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:25:15,394 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:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 09:25:15,395 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:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 09:25:15,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-08 09:25:15,413 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:15,414 INFO L225 Difference]: With dead ends: 23 [2022-04-08 09:25:15,414 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 09:25:15,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-04-08 09:25:15,415 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:25:15,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:25:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 09:25:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 09:25:15,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:25:15,426 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:15,426 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:15,426 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:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:15,427 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:25:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:25:15,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:15,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:15,428 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:15,428 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:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:25:15,428 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 09:25:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:25:15,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:25:15,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:25:15,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:25:15,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:25:15,429 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:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 09:25:15,430 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 09:25:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:25:15,430 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 09:25:15,430 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:15,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 09:25:15,446 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:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:25:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:25:15,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:25:15,446 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:25:15,467 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:15,646 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:15,647 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:25:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:25:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-08 09:25:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:25:15,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1524732785] [2022-04-08 09:25:15,651 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:25:15,651 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:25:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-08 09:25:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:25:15,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665429602] [2022-04-08 09:25:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:25:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:25:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:25:15,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 09:25:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:25:15,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 09:25:15,688 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 09:25:15,688 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 09:25:15,690 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:25:15,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 09:25:15,694 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-08 09:25:15,696 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 09:25:15,704 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 09:25:15,705 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 09:25:15,705 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:25:15,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:25:15 BoogieIcfgContainer [2022-04-08 09:25:15,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:25:15,707 INFO L158 Benchmark]: Toolchain (without parser) took 6026.03ms. Allocated memory was 191.9MB in the beginning and 233.8MB in the end (delta: 41.9MB). Free memory was 145.0MB in the beginning and 172.3MB in the end (delta: -27.3MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-04-08 09:25:15,707 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 191.9MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:25:15,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.57ms. Allocated memory is still 191.9MB. Free memory was 144.9MB in the beginning and 171.2MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:25:15,708 INFO L158 Benchmark]: Boogie Preprocessor took 34.49ms. Allocated memory is still 191.9MB. Free memory was 171.2MB in the beginning and 169.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:25:15,708 INFO L158 Benchmark]: RCFGBuilder took 239.69ms. Allocated memory is still 191.9MB. Free memory was 169.8MB in the beginning and 159.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:25:15,708 INFO L158 Benchmark]: TraceAbstraction took 5549.80ms. Allocated memory was 191.9MB in the beginning and 233.8MB in the end (delta: 41.9MB). Free memory was 159.4MB in the beginning and 172.3MB in the end (delta: -12.9MB). Peak memory consumption was 30.3MB. Max. memory is 8.0GB. [2022-04-08 09:25:15,709 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.14ms. Allocated memory is still 191.9MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.57ms. Allocated memory is still 191.9MB. Free memory was 144.9MB in the beginning and 171.2MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.49ms. Allocated memory is still 191.9MB. Free memory was 171.2MB in the beginning and 169.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 239.69ms. Allocated memory is still 191.9MB. Free memory was 169.8MB in the beginning and 159.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5549.80ms. Allocated memory was 191.9MB in the beginning and 233.8MB in the end (delta: 41.9MB). Free memory was 159.4MB in the beginning and 172.3MB in the end (delta: -12.9MB). Peak memory consumption was 30.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L13] unsigned int x = 0; [L14] unsigned int y = 1; [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND FALSE !(x < 6) [L21] CALL __VERIFIER_assert(y != 64) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 83 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-08 09:25:15,721 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...