/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/loops-crafted-1/mono-crafted_14.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:01:27,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:01:27,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:01:27,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:01:27,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:01:27,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:01:27,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:01:27,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:01:27,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:01:27,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:01:27,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:01:27,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:01:27,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:01:27,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:01:27,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:01:27,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:01:27,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:01:27,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:01:27,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:01:27,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:01:27,085 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:01:27,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:01:27,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:01:27,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:01:27,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:01:27,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:01:27,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:01:27,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:01:27,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:01:27,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:01:27,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:01:27,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:01:27,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:01:27,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:01:27,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:01:27,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:01:27,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:01:27,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:01:27,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:01:27,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:01:27,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:01:27,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:01:27,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:01:27,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:01:27,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:01:27,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:01:27,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:01:27,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:01:27,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:01:27,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:01:27,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:01:27,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:01:27,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:01:27,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:01:27,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:01:27,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:01:27,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:01:27,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:01:27,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:27,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:01:27,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:01:27,116 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:01:27,116 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:01:27,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:01:27,116 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:01:27,116 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:01:27,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:01:27,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:01:27,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:01:27,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:01:27,337 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:01:27,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_14.c [2022-04-15 13:01:27,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c77cc43c/da1cf76b1fa54a7fa7cb39e98effcf32/FLAGc8739cbd8 [2022-04-15 13:01:27,742 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:01:27,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_14.c [2022-04-15 13:01:27,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c77cc43c/da1cf76b1fa54a7fa7cb39e98effcf32/FLAGc8739cbd8 [2022-04-15 13:01:28,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c77cc43c/da1cf76b1fa54a7fa7cb39e98effcf32 [2022-04-15 13:01:28,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:01:28,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:01:28,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:28,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:01:28,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:01:28,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d90da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28, skipping insertion in model container [2022-04-15 13:01:28,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:01:28,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:01:28,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_14.c[319,332] [2022-04-15 13:01:28,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:28,396 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:01:28,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_14.c[319,332] [2022-04-15 13:01:28,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:28,419 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:01:28,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28 WrapperNode [2022-04-15 13:01:28,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:28,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:01:28,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:01:28,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:01:28,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:01:28,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:01:28,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:01:28,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:01:28,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (1/1) ... [2022-04-15 13:01:28,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:28,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:28,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:01:28,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:01:28,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:01:28,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:01:28,516 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:01:28,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:01:28,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:01:28,516 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:01:28,516 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:01:28,516 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:01:28,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:01:28,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:01:28,559 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:01:28,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:01:28,697 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:01:28,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:01:28,705 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:01:28,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:28 BoogieIcfgContainer [2022-04-15 13:01:28,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:01:28,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:01:28,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:01:28,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:01:28,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:01:28" (1/3) ... [2022-04-15 13:01:28,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5305bb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:28, skipping insertion in model container [2022-04-15 13:01:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:28" (2/3) ... [2022-04-15 13:01:28,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5305bb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:28, skipping insertion in model container [2022-04-15 13:01:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:28" (3/3) ... [2022-04-15 13:01:28,727 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_14.c [2022-04-15 13:01:28,731 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:01:28,731 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:01:28,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:01:28,764 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:01:28,765 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:01:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:01:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:01:28,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:28,782 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:28,783 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1104150160, now seen corresponding path program 1 times [2022-04-15 13:01:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:28,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418648105] [2022-04-15 13:01:28,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1104150160, now seen corresponding path program 2 times [2022-04-15 13:01:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:28,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024187065] [2022-04-15 13:01:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:28,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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); {25#true} is VALID [2022-04-15 13:01:28,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:01:28,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #53#return; {25#true} is VALID [2022-04-15 13:01:28,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:28,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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); {25#true} is VALID [2022-04-15 13:01:28,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:01:28,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #53#return; {25#true} is VALID [2022-04-15 13:01:28,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret9 := main(); {25#true} is VALID [2022-04-15 13:01:28,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25#true} is VALID [2022-04-15 13:01:28,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 13:01:28,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-04-15 13:01:28,954 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {26#false} is VALID [2022-04-15 13:01:28,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 13:01:28,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 13:01:28,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 13:01:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:28,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024187065] [2022-04-15 13:01:28,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024187065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:28,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:28,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:28,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:28,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418648105] [2022-04-15 13:01:28,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418648105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:28,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:28,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713193248] [2022-04-15 13:01:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-15 13:01:28,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:28,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-15 13:01:28,999 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-15 13:01:29,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:01:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:01:29,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:01:29,024 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-15 13:01:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,122 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 13:01:29,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:01:29,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-15 13:01:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-15 13:01:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 13:01:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-15 13:01:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 13:01:29,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 13:01:29,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,205 INFO L225 Difference]: With dead ends: 36 [2022-04-15 13:01:29,205 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:01:29,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:01:29,212 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:29,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:01:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:01:29,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:29,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,235 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,236 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,238 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 13:01:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 13:01:29,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 13:01:29,239 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 13:01:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,241 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 13:01:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 13:01:29,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:29,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-15 13:01:29,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-15 13:01:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:29,253 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-15 13:01:29,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-15 13:01:29,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-15 13:01:29,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 13:01:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:01:29,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:29,273 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:29,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:01:29,273 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1394135754, now seen corresponding path program 1 times [2022-04-15 13:01:29,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:29,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1646531500] [2022-04-15 13:01:29,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1394135754, now seen corresponding path program 2 times [2022-04-15 13:01:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:29,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153852712] [2022-04-15 13:01:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:29,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:29,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(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); {173#true} is VALID [2022-04-15 13:01:29,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 13:01:29,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #53#return; {173#true} is VALID [2022-04-15 13:01:29,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:29,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(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); {173#true} is VALID [2022-04-15 13:01:29,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 13:01:29,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #53#return; {173#true} is VALID [2022-04-15 13:01:29,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret9 := main(); {173#true} is VALID [2022-04-15 13:01:29,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {178#(= main_~x~0 0)} is VALID [2022-04-15 13:01:29,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= main_~x~0 0)} assume !(~x~0 < 1000000); {174#false} is VALID [2022-04-15 13:01:29,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#false} assume !(~y~0 > 0); {174#false} is VALID [2022-04-15 13:01:29,319 INFO L272 TraceCheckUtils]: 8: Hoare triple {174#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {174#false} is VALID [2022-04-15 13:01:29,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#false} ~cond := #in~cond; {174#false} is VALID [2022-04-15 13:01:29,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#false} assume 0 == ~cond; {174#false} is VALID [2022-04-15 13:01:29,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-15 13:01:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:29,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153852712] [2022-04-15 13:01:29,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153852712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:29,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:29,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:29,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:29,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1646531500] [2022-04-15 13:01:29,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1646531500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:29,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:29,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947957789] [2022-04-15 13:01:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:29,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 13:01:29,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:29,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 13:01:29,331 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-15 13:01:29,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:01:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:29,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:01:29,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:01:29,333 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 13:01:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,392 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 13:01:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:01:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 13:01:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 13:01:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 13:01:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 13:01:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 13:01:29,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 13:01:29,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,427 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:01:29,427 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:01:29,428 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-15 13:01:29,428 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:29,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:01:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:01:29,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:29,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,433 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,433 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,435 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 13:01:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:01:29,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 13:01:29,435 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 13:01:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,437 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 13:01:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:01:29,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:29,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 13:01:29,438 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-15 13:01:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:29,439 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 13:01:29,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-15 13:01:29,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 13:01:29,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:01:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:01:29,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:29,458 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:29,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:01:29,458 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 479542393, now seen corresponding path program 1 times [2022-04-15 13:01:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:29,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930881336] [2022-04-15 13:01:29,536 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:01:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash -697934047, now seen corresponding path program 1 times [2022-04-15 13:01:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:29,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988201397] [2022-04-15 13:01:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:29,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(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); {320#true} is VALID [2022-04-15 13:01:29,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-15 13:01:29,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #53#return; {320#true} is VALID [2022-04-15 13:01:29,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:29,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(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); {320#true} is VALID [2022-04-15 13:01:29,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-15 13:01:29,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #53#return; {320#true} is VALID [2022-04-15 13:01:29,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret9 := main(); {320#true} is VALID [2022-04-15 13:01:29,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {325#(<= 500000 main_~y~0)} is VALID [2022-04-15 13:01:29,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(<= 500000 main_~y~0)} [61] L10-2-->L17-1_primed: Formula: (or (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post4_Out_2| 0) (< v_main_~x~0_Out_2 500001)) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post4=|v_main_#t~post4_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {325#(<= 500000 main_~y~0)} is VALID [2022-04-15 13:01:29,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(<= 500000 main_~y~0)} [60] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {325#(<= 500000 main_~y~0)} is VALID [2022-04-15 13:01:29,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {325#(<= 500000 main_~y~0)} assume !(~y~0 > 0); {321#false} is VALID [2022-04-15 13:01:29,578 INFO L272 TraceCheckUtils]: 9: Hoare triple {321#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {321#false} is VALID [2022-04-15 13:01:29,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {321#false} ~cond := #in~cond; {321#false} is VALID [2022-04-15 13:01:29,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#false} assume 0 == ~cond; {321#false} is VALID [2022-04-15 13:01:29,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {321#false} assume !false; {321#false} is VALID [2022-04-15 13:01:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:29,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:29,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988201397] [2022-04-15 13:01:29,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988201397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:29,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:29,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:29,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:29,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930881336] [2022-04-15 13:01:29,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930881336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:29,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:29,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:01:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184463800] [2022-04-15 13:01:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:01:29,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:29,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:01:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:01:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:01:29,630 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,749 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-15 13:01:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:01:29,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:01:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-15 13:01:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-15 13:01:29,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-15 13:01:29,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,782 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:01:29,783 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 13:01:29,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:01:29,784 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:29,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 13:01:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 13:01:29,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:29,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,795 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,795 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,797 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 13:01:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:01:29,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 13:01:29,798 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 13:01:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:29,803 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 13:01:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:01:29,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:29,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:29,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:29,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:01:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 13:01:29,806 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2022-04-15 13:01:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:29,806 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 13:01:29,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:29,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 13:01:29,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:01:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:01:29,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:29,830 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:29,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:01:29,831 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1190018304, now seen corresponding path program 1 times [2022-04-15 13:01:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:29,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039761071]