./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b582e34b3a12ea058d8fdede8c5fe9e08faea5af2c4c7b390003b46348eed98b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:02:39,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:02:39,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:02:39,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:02:39,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:02:39,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:02:39,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:02:39,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:02:39,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:02:39,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:02:39,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:02:39,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:02:39,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:02:39,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:02:39,588 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:02:39,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:02:39,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:02:39,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:02:39,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:02:39,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:02:39,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:02:39,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:02:39,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:02:39,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:02:39,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:02:39,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:02:39,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:02:39,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:02:39,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:02:39,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:02:39,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:02:39,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:02:39,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:02:39,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:02:39,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:02:39,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:02:39,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:02:39,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:02:39,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:02:39,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:02:39,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:02:39,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:02:39,596 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b582e34b3a12ea058d8fdede8c5fe9e08faea5af2c4c7b390003b46348eed98b [2024-11-19 00:02:39,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:02:39,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:02:39,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:02:39,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:02:39,802 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:02:39,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i [2024-11-19 00:02:41,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:02:41,499 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:02:41,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i [2024-11-19 00:02:41,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ad2bdd1/d18bb30c4cb344a7888474a44d1d34e0/FLAG29633e6d7 [2024-11-19 00:02:41,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ad2bdd1/d18bb30c4cb344a7888474a44d1d34e0 [2024-11-19 00:02:41,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:02:41,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:02:41,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:02:41,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:02:41,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:02:41,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:41" (1/1) ... [2024-11-19 00:02:41,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78eb153d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:41, skipping insertion in model container [2024-11-19 00:02:41,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:41" (1/1) ... [2024-11-19 00:02:41,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:02:41,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i[916,929] [2024-11-19 00:02:41,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:02:41,996 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:02:42,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i[916,929] [2024-11-19 00:02:42,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:02:42,156 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:02:42,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42 WrapperNode [2024-11-19 00:02:42,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:02:42,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:02:42,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:02:42,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:02:42,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,310 INFO L138 Inliner]: procedures = 26, calls = 98, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 752 [2024-11-19 00:02:42,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:02:42,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:02:42,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:02:42,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:02:42,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,429 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:02:42,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:02:42,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:02:42,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:02:42,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:02:42,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:02:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:02:42,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:02:42,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:02:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:02:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:02:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:02:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:02:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:02:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:02:42,823 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:02:42,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:02:43,924 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-19 00:02:43,925 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:02:43,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:02:43,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:02:43,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:43 BoogieIcfgContainer [2024-11-19 00:02:43,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:02:43,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:02:43,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:02:43,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:02:43,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:02:41" (1/3) ... [2024-11-19 00:02:43,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb8af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:43, skipping insertion in model container [2024-11-19 00:02:43,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (2/3) ... [2024-11-19 00:02:43,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb8af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:43, skipping insertion in model container [2024-11-19 00:02:43,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:43" (3/3) ... [2024-11-19 00:02:43,945 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-29.i [2024-11-19 00:02:43,957 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:02:43,958 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:02:44,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:02:44,016 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e179517, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:02:44,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:02:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 211 states have (on average 1.5355450236966826) internal successors, (324), 212 states have internal predecessors, (324), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:02:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-11-19 00:02:44,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:44,043 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:44,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:44,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash -679134274, now seen corresponding path program 1 times [2024-11-19 00:02:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138604904] [2024-11-19 00:02:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2024-11-19 00:02:44,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138604904] [2024-11-19 00:02:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138604904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:02:44,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872606652] [2024-11-19 00:02:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:44,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:02:44,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:02:44,648 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) [2024-11-19 00:02:44,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:02:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:44,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:02:45,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:02:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2024-11-19 00:02:45,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:02:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872606652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:02:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:02:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032718645] [2024-11-19 00:02:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:45,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:02:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:02:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:02:45,154 INFO L87 Difference]: Start difference. First operand has 299 states, 211 states have (on average 1.5355450236966826) internal successors, (324), 212 states have internal predecessors, (324), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-19 00:02:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:45,242 INFO L93 Difference]: Finished difference Result 591 states and 1067 transitions. [2024-11-19 00:02:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:02:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) Word has length 568 [2024-11-19 00:02:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:45,258 INFO L225 Difference]: With dead ends: 591 [2024-11-19 00:02:45,259 INFO L226 Difference]: Without dead ends: 295 [2024-11-19 00:02:45,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:02:45,270 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:45,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-19 00:02:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-19 00:02:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:02:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 487 transitions. [2024-11-19 00:02:45,414 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 487 transitions. Word has length 568 [2024-11-19 00:02:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 487 transitions. [2024-11-19 00:02:45,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-19 00:02:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 487 transitions. [2024-11-19 00:02:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-11-19 00:02:45,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:45,443 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:45,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:02:45,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:02:45,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1098596408, now seen corresponding path program 1 times [2024-11-19 00:02:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158172268] [2024-11-19 00:02:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158172268] [2024-11-19 00:02:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158172268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:46,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:46,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:46,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486516886] [2024-11-19 00:02:46,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:46,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:46,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:46,156 INFO L87 Difference]: Start difference. First operand 295 states and 487 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:46,271 INFO L93 Difference]: Finished difference Result 868 states and 1435 transitions. [2024-11-19 00:02:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 568 [2024-11-19 00:02:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:46,280 INFO L225 Difference]: With dead ends: 868 [2024-11-19 00:02:46,281 INFO L226 Difference]: Without dead ends: 576 [2024-11-19 00:02:46,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:46,284 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 463 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:46,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 962 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-19 00:02:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 296. [2024-11-19 00:02:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 209 states have internal predecessors, (318), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:02:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 488 transitions. [2024-11-19 00:02:46,342 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 488 transitions. Word has length 568 [2024-11-19 00:02:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:46,346 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 488 transitions. [2024-11-19 00:02:46,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 488 transitions. [2024-11-19 00:02:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-11-19 00:02:46,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:46,358 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:46,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:02:46,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:46,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 824631626, now seen corresponding path program 1 times [2024-11-19 00:02:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:46,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369229643] [2024-11-19 00:02:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:46,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:47,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369229643] [2024-11-19 00:02:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369229643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:47,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:47,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:47,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685193409] [2024-11-19 00:02:47,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:47,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:47,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:47,321 INFO L87 Difference]: Start difference. First operand 296 states and 488 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:47,654 INFO L93 Difference]: Finished difference Result 921 states and 1515 transitions. [2024-11-19 00:02:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 568 [2024-11-19 00:02:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:47,661 INFO L225 Difference]: With dead ends: 921 [2024-11-19 00:02:47,662 INFO L226 Difference]: Without dead ends: 628 [2024-11-19 00:02:47,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:47,665 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 566 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:47,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1495 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:02:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-19 00:02:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 586. [2024-11-19 00:02:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 413 states have (on average 1.523002421307506) internal successors, (629), 413 states have internal predecessors, (629), 170 states have call successors, (170), 2 states have call predecessors, (170), 2 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-19 00:02:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 969 transitions. [2024-11-19 00:02:47,732 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 969 transitions. Word has length 568 [2024-11-19 00:02:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:47,735 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 969 transitions. [2024-11-19 00:02:47,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 969 transitions. [2024-11-19 00:02:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2024-11-19 00:02:47,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:47,741 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:47,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:02:47,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:47,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash -783589467, now seen corresponding path program 1 times [2024-11-19 00:02:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:47,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801384344] [2024-11-19 00:02:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:48,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:48,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801384344] [2024-11-19 00:02:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801384344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:48,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:48,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:48,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557252977] [2024-11-19 00:02:48,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:48,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:48,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:48,540 INFO L87 Difference]: Start difference. First operand 586 states and 969 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:48,602 INFO L93 Difference]: Finished difference Result 1752 states and 2901 transitions. [2024-11-19 00:02:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 569 [2024-11-19 00:02:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:48,609 INFO L225 Difference]: With dead ends: 1752 [2024-11-19 00:02:48,610 INFO L226 Difference]: Without dead ends: 1169 [2024-11-19 00:02:48,611 INFO L431 NwaCegarLoop]: 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 [2024-11-19 00:02:48,612 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 287 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:48,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 962 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2024-11-19 00:02:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1165. [2024-11-19 00:02:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 820 states have (on average 1.5219512195121951) internal successors, (1248), 820 states have internal predecessors, (1248), 340 states have call successors, (340), 4 states have call predecessors, (340), 4 states have return successors, (340), 340 states have call predecessors, (340), 340 states have call successors, (340) [2024-11-19 00:02:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1928 transitions. [2024-11-19 00:02:48,703 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1928 transitions. Word has length 569 [2024-11-19 00:02:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:48,704 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1928 transitions. [2024-11-19 00:02:48,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1928 transitions. [2024-11-19 00:02:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2024-11-19 00:02:48,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:48,708 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:48,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:02:48,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:48,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash -508829853, now seen corresponding path program 1 times [2024-11-19 00:02:48,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:48,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284971359] [2024-11-19 00:02:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:50,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:50,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284971359] [2024-11-19 00:02:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284971359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:50,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:50,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:02:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909199833] [2024-11-19 00:02:50,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:02:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:02:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:02:50,628 INFO L87 Difference]: Start difference. First operand 1165 states and 1928 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:51,750 INFO L93 Difference]: Finished difference Result 2776 states and 4585 transitions. [2024-11-19 00:02:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:02:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 569 [2024-11-19 00:02:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:51,762 INFO L225 Difference]: With dead ends: 2776 [2024-11-19 00:02:51,763 INFO L226 Difference]: Without dead ends: 1614 [2024-11-19 00:02:51,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:02:51,768 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 674 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:51,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 2277 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:02:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-11-19 00:02:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1344. [2024-11-19 00:02:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 913 states have (on average 1.5005476451259583) internal successors, (1370), 913 states have internal predecessors, (1370), 425 states have call successors, (425), 5 states have call predecessors, (425), 5 states have return successors, (425), 425 states have call predecessors, (425), 425 states have call successors, (425) [2024-11-19 00:02:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2220 transitions. [2024-11-19 00:02:51,916 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2220 transitions. Word has length 569 [2024-11-19 00:02:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:51,916 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2220 transitions. [2024-11-19 00:02:51,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2220 transitions. [2024-11-19 00:02:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2024-11-19 00:02:51,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:51,920 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:51,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:02:51,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1338275501, now seen corresponding path program 1 times [2024-11-19 00:02:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191008321] [2024-11-19 00:02:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191008321] [2024-11-19 00:02:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191008321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:54,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:54,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:02:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076417056] [2024-11-19 00:02:54,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:54,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:02:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:02:54,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:02:54,720 INFO L87 Difference]: Start difference. First operand 1344 states and 2220 transitions. Second operand has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2024-11-19 00:02:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:56,784 INFO L93 Difference]: Finished difference Result 3106 states and 5135 transitions. [2024-11-19 00:02:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:02:56,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) Word has length 570 [2024-11-19 00:02:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:56,796 INFO L225 Difference]: With dead ends: 3106 [2024-11-19 00:02:56,797 INFO L226 Difference]: Without dead ends: 1944 [2024-11-19 00:02:56,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:02:56,802 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 2341 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:56,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2341 Valid, 3681 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:02:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2024-11-19 00:02:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1404. [2024-11-19 00:02:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 972 states have (on average 1.5102880658436213) internal successors, (1468), 972 states have internal predecessors, (1468), 425 states have call successors, (425), 6 states have call predecessors, (425), 6 states have return successors, (425), 425 states have call predecessors, (425), 425 states have call successors, (425) [2024-11-19 00:02:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2318 transitions. [2024-11-19 00:02:56,985 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2318 transitions. Word has length 570 [2024-11-19 00:02:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:56,986 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2318 transitions. [2024-11-19 00:02:56,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2024-11-19 00:02:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2318 transitions. [2024-11-19 00:02:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-11-19 00:02:56,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:56,990 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:56,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:02:56,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash -481050691, now seen corresponding path program 1 times [2024-11-19 00:02:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777800656] [2024-11-19 00:02:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:02:58,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777800656] [2024-11-19 00:02:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777800656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:02:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294232031] [2024-11-19 00:02:58,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:58,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:02:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:58,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:02:58,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:02:58,206 INFO L87 Difference]: Start difference. First operand 1404 states and 2318 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:58,932 INFO L93 Difference]: Finished difference Result 4028 states and 6660 transitions. [2024-11-19 00:02:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:02:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 571 [2024-11-19 00:02:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:58,945 INFO L225 Difference]: With dead ends: 4028 [2024-11-19 00:02:58,946 INFO L226 Difference]: Without dead ends: 2866 [2024-11-19 00:02:58,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:02:58,951 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 819 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:58,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 2165 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:02:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2024-11-19 00:02:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2780. [2024-11-19 00:02:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2028 states have (on average 1.5359960552268244) internal successors, (3115), 2032 states have internal predecessors, (3115), 739 states have call successors, (739), 12 states have call predecessors, (739), 12 states have return successors, (739), 735 states have call predecessors, (739), 739 states have call successors, (739) [2024-11-19 00:02:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 4593 transitions. [2024-11-19 00:02:59,152 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 4593 transitions. Word has length 571 [2024-11-19 00:02:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:59,153 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 4593 transitions. [2024-11-19 00:02:59,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:02:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 4593 transitions. [2024-11-19 00:02:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-11-19 00:02:59,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:59,157 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:02:59,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:02:59,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:59,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 562375901, now seen corresponding path program 1 times [2024-11-19 00:02:59,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:59,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603886707] [2024-11-19 00:02:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603886707] [2024-11-19 00:03:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603886707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:00,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:03:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775319150] [2024-11-19 00:03:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:03:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:00,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:03:00,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:03:00,474 INFO L87 Difference]: Start difference. First operand 2780 states and 4593 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:00,616 INFO L93 Difference]: Finished difference Result 6447 states and 10697 transitions. [2024-11-19 00:03:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:03:00,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 571 [2024-11-19 00:03:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:00,633 INFO L225 Difference]: With dead ends: 6447 [2024-11-19 00:03:00,634 INFO L226 Difference]: Without dead ends: 3918 [2024-11-19 00:03:00,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:03:00,642 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 195 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:00,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1314 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:03:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2024-11-19 00:03:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 3503. [2024-11-19 00:03:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 2736 states have (on average 1.5599415204678362) internal successors, (4268), 2745 states have internal predecessors, (4268), 749 states have call successors, (749), 17 states have call predecessors, (749), 17 states have return successors, (749), 740 states have call predecessors, (749), 749 states have call successors, (749) [2024-11-19 00:03:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5766 transitions. [2024-11-19 00:03:00,870 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5766 transitions. Word has length 571 [2024-11-19 00:03:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:00,870 INFO L471 AbstractCegarLoop]: Abstraction has 3503 states and 5766 transitions. [2024-11-19 00:03:00,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5766 transitions. [2024-11-19 00:03:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-19 00:03:00,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:00,875 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:03:00,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:03:00,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:00,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash 914372208, now seen corresponding path program 1 times [2024-11-19 00:03:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:00,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441587878] [2024-11-19 00:03:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441587878] [2024-11-19 00:03:02,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441587878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:02,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:02,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:03:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099583348] [2024-11-19 00:03:02,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:02,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:03:02,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:02,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:03:02,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:03:02,722 INFO L87 Difference]: Start difference. First operand 3503 states and 5766 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-19 00:03:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:03,873 INFO L93 Difference]: Finished difference Result 12766 states and 20939 transitions. [2024-11-19 00:03:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:03:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 572 [2024-11-19 00:03:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:03,921 INFO L225 Difference]: With dead ends: 12766 [2024-11-19 00:03:03,921 INFO L226 Difference]: Without dead ends: 9417 [2024-11-19 00:03:03,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:03:03,934 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 645 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:03,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 3131 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:03:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2024-11-19 00:03:04,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 6850. [2024-11-19 00:03:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6850 states, 5404 states have (on average 1.5645817912657292) internal successors, (8455), 5422 states have internal predecessors, (8455), 1413 states have call successors, (1413), 32 states have call predecessors, (1413), 32 states have return successors, (1413), 1395 states have call predecessors, (1413), 1413 states have call successors, (1413) [2024-11-19 00:03:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6850 states to 6850 states and 11281 transitions. [2024-11-19 00:03:04,666 INFO L78 Accepts]: Start accepts. Automaton has 6850 states and 11281 transitions. Word has length 572 [2024-11-19 00:03:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:04,667 INFO L471 AbstractCegarLoop]: Abstraction has 6850 states and 11281 transitions. [2024-11-19 00:03:04,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-19 00:03:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6850 states and 11281 transitions. [2024-11-19 00:03:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-19 00:03:04,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:04,675 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:03:04,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:03:04,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 660297072, now seen corresponding path program 1 times [2024-11-19 00:03:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966610175] [2024-11-19 00:03:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966610175] [2024-11-19 00:03:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966610175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:03:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091705961] [2024-11-19 00:03:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:05,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:03:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:03:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:03:05,531 INFO L87 Difference]: Start difference. First operand 6850 states and 11281 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:05,955 INFO L93 Difference]: Finished difference Result 19130 states and 31424 transitions. [2024-11-19 00:03:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:03:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2024-11-19 00:03:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:06,016 INFO L225 Difference]: With dead ends: 19130 [2024-11-19 00:03:06,017 INFO L226 Difference]: Without dead ends: 12848 [2024-11-19 00:03:06,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:03:06,039 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 659 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:06,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1483 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:03:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12848 states. [2024-11-19 00:03:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12848 to 12278. [2024-11-19 00:03:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12278 states, 9453 states have (on average 1.539193906696287) internal successors, (14550), 9501 states have internal predecessors, (14550), 2741 states have call successors, (2741), 83 states have call predecessors, (2741), 83 states have return successors, (2741), 2693 states have call predecessors, (2741), 2741 states have call successors, (2741) [2024-11-19 00:03:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12278 states to 12278 states and 20032 transitions. [2024-11-19 00:03:07,176 INFO L78 Accepts]: Start accepts. Automaton has 12278 states and 20032 transitions. Word has length 572 [2024-11-19 00:03:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:07,177 INFO L471 AbstractCegarLoop]: Abstraction has 12278 states and 20032 transitions. [2024-11-19 00:03:07,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 12278 states and 20032 transitions. [2024-11-19 00:03:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-19 00:03:07,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:07,187 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:03:07,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:03:07,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:07,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2096330194, now seen corresponding path program 1 times [2024-11-19 00:03:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:07,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650518324] [2024-11-19 00:03:07,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:07,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:08,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650518324] [2024-11-19 00:03:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650518324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:03:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145343019] [2024-11-19 00:03:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:08,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:03:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:08,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:03:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:03:08,357 INFO L87 Difference]: Start difference. First operand 12278 states and 20032 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:09,715 INFO L93 Difference]: Finished difference Result 40578 states and 65984 transitions. [2024-11-19 00:03:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:03:09,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2024-11-19 00:03:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:09,832 INFO L225 Difference]: With dead ends: 40578 [2024-11-19 00:03:09,832 INFO L226 Difference]: Without dead ends: 29068 [2024-11-19 00:03:09,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:03:09,878 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 940 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:09,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 2359 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:03:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29068 states. [2024-11-19 00:03:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29068 to 29022. [2024-11-19 00:03:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29022 states, 23121 states have (on average 1.5437048570563556) internal successors, (35692), 23277 states have internal predecessors, (35692), 5677 states have call successors, (5677), 223 states have call predecessors, (5677), 223 states have return successors, (5677), 5521 states have call predecessors, (5677), 5677 states have call successors, (5677) [2024-11-19 00:03:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29022 states to 29022 states and 47046 transitions. [2024-11-19 00:03:11,834 INFO L78 Accepts]: Start accepts. Automaton has 29022 states and 47046 transitions. Word has length 572 [2024-11-19 00:03:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:11,835 INFO L471 AbstractCegarLoop]: Abstraction has 29022 states and 47046 transitions. [2024-11-19 00:03:11,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29022 states and 47046 transitions. [2024-11-19 00:03:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-19 00:03:11,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:11,855 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:03:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:03:11,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:11,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1354631600, now seen corresponding path program 1 times [2024-11-19 00:03:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599180677] [2024-11-19 00:03:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:13,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599180677] [2024-11-19 00:03:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599180677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:13,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:13,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:03:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365003507] [2024-11-19 00:03:13,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:13,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:03:13,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:13,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:03:13,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:03:13,187 INFO L87 Difference]: Start difference. First operand 29022 states and 47046 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:14,228 INFO L93 Difference]: Finished difference Result 77894 states and 126563 transitions. [2024-11-19 00:03:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:03:14,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2024-11-19 00:03:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:14,400 INFO L225 Difference]: With dead ends: 77894 [2024-11-19 00:03:14,401 INFO L226 Difference]: Without dead ends: 49692 [2024-11-19 00:03:14,475 INFO L431 NwaCegarLoop]: 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 [2024-11-19 00:03:14,476 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 253 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:14,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1536 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:03:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49692 states. [2024-11-19 00:03:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49692 to 46490. [2024-11-19 00:03:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46490 states, 40048 states have (on average 1.5801787854574512) internal successors, (63283), 40324 states have internal predecessors, (63283), 6037 states have call successors, (6037), 404 states have call predecessors, (6037), 404 states have return successors, (6037), 5761 states have call predecessors, (6037), 6037 states have call successors, (6037) [2024-11-19 00:03:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46490 states to 46490 states and 75357 transitions. [2024-11-19 00:03:16,631 INFO L78 Accepts]: Start accepts. Automaton has 46490 states and 75357 transitions. Word has length 572 [2024-11-19 00:03:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:16,632 INFO L471 AbstractCegarLoop]: Abstraction has 46490 states and 75357 transitions. [2024-11-19 00:03:16,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 46490 states and 75357 transitions. [2024-11-19 00:03:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-19 00:03:16,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:16,666 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:03:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:03:16,667 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:16,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1206231246, now seen corresponding path program 1 times [2024-11-19 00:03:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436895265] [2024-11-19 00:03:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:21,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436895265] [2024-11-19 00:03:21,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436895265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:21,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:21,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:03:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583996197] [2024-11-19 00:03:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:03:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:03:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:03:21,051 INFO L87 Difference]: Start difference. First operand 46490 states and 75357 transitions. Second operand has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-11-19 00:03:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:26,237 INFO L93 Difference]: Finished difference Result 107716 states and 174621 transitions. [2024-11-19 00:03:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:03:26,238 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) Word has length 572 [2024-11-19 00:03:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:26,466 INFO L225 Difference]: With dead ends: 107716 [2024-11-19 00:03:26,466 INFO L226 Difference]: Without dead ends: 85176 [2024-11-19 00:03:26,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2024-11-19 00:03:26,509 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 4348 mSDsluCounter, 3613 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4348 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:26,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4348 Valid, 4038 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 00:03:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85176 states. [2024-11-19 00:03:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85176 to 48905. [2024-11-19 00:03:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48905 states, 42462 states have (on average 1.5857708068390561) internal successors, (67335), 42738 states have internal predecessors, (67335), 6037 states have call successors, (6037), 405 states have call predecessors, (6037), 405 states have return successors, (6037), 5761 states have call predecessors, (6037), 6037 states have call successors, (6037) [2024-11-19 00:03:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48905 states to 48905 states and 79409 transitions. [2024-11-19 00:03:29,015 INFO L78 Accepts]: Start accepts. Automaton has 48905 states and 79409 transitions. Word has length 572 [2024-11-19 00:03:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:29,016 INFO L471 AbstractCegarLoop]: Abstraction has 48905 states and 79409 transitions. [2024-11-19 00:03:29,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 4 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-11-19 00:03:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48905 states and 79409 transitions. [2024-11-19 00:03:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-19 00:03:29,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:29,049 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:03:29,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:03:29,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:29,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash 73632432, now seen corresponding path program 1 times [2024-11-19 00:03:29,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109303281] [2024-11-19 00:03:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 15 proven. 237 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2024-11-19 00:03:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109303281] [2024-11-19 00:03:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109303281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:03:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119190963] [2024-11-19 00:03:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:31,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:03:31,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:03:31,538 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) [2024-11-19 00:03:31,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:03:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:31,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:03:31,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:03:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 8790 proven. 240 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked. [2024-11-19 00:03:33,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:03:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 141 proven. 111 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2024-11-19 00:03:34,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119190963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:03:34,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:03:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 11] total 24 [2024-11-19 00:03:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52595725] [2024-11-19 00:03:34,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:03:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 00:03:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 00:03:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:03:34,462 INFO L87 Difference]: Start difference. First operand 48905 states and 79409 transitions. Second operand has 24 states, 24 states have (on average 16.791666666666668) internal successors, (403), 24 states have internal predecessors, (403), 7 states have call successors, (208), 4 states have call predecessors, (208), 7 states have return successors, (210), 7 states have call predecessors, (210), 7 states have call successors, (210) [2024-11-19 00:03:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:45,923 INFO L93 Difference]: Finished difference Result 169841 states and 265030 transitions. [2024-11-19 00:03:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-11-19 00:03:45,924 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 16.791666666666668) internal successors, (403), 24 states have internal predecessors, (403), 7 states have call successors, (208), 4 states have call predecessors, (208), 7 states have return successors, (210), 7 states have call predecessors, (210), 7 states have call successors, (210) Word has length 572 [2024-11-19 00:03:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:46,535 INFO L225 Difference]: With dead ends: 169841 [2024-11-19 00:03:46,535 INFO L226 Difference]: Without dead ends: 121525 [2024-11-19 00:03:46,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1250 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4908 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2738, Invalid=11782, Unknown=0, NotChecked=0, Total=14520 [2024-11-19 00:03:46,626 INFO L432 NwaCegarLoop]: 680 mSDtfsCounter, 2073 mSDsluCounter, 4360 mSDsCounter, 0 mSdLazyCounter, 4940 mSolverCounterSat, 1083 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2077 SdHoareTripleChecker+Valid, 5040 SdHoareTripleChecker+Invalid, 6023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1083 IncrementalHoareTripleChecker+Valid, 4940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:46,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2077 Valid, 5040 Invalid, 6023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1083 Valid, 4940 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 00:03:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121525 states. [2024-11-19 00:03:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121525 to 34409. [2024-11-19 00:03:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34409 states, 29706 states have (on average 1.5866491617854979) internal successors, (47133), 29802 states have internal predecessors, (47133), 4317 states have call successors, (4317), 385 states have call predecessors, (4317), 385 states have return successors, (4317), 4221 states have call predecessors, (4317), 4317 states have call successors, (4317) [2024-11-19 00:03:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34409 states to 34409 states and 55767 transitions. [2024-11-19 00:03:50,572 INFO L78 Accepts]: Start accepts. Automaton has 34409 states and 55767 transitions. Word has length 572 [2024-11-19 00:03:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:50,573 INFO L471 AbstractCegarLoop]: Abstraction has 34409 states and 55767 transitions. [2024-11-19 00:03:50,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 16.791666666666668) internal successors, (403), 24 states have internal predecessors, (403), 7 states have call successors, (208), 4 states have call predecessors, (208), 7 states have return successors, (210), 7 states have call predecessors, (210), 7 states have call successors, (210) [2024-11-19 00:03:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 34409 states and 55767 transitions. [2024-11-19 00:03:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-19 00:03:50,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:50,588 INFO L215 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:03:50,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:03:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 00:03:50,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:50,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:50,790 INFO L85 PathProgramCache]: Analyzing trace with hash 467671946, now seen corresponding path program 1 times [2024-11-19 00:03:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:50,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169258436] [2024-11-19 00:03:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2024-11-19 00:03:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169258436] [2024-11-19 00:03:50,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169258436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:50,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:50,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:03:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074783486] [2024-11-19 00:03:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:03:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:03:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:03:50,992 INFO L87 Difference]: Start difference. First operand 34409 states and 55767 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2024-11-19 00:03:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:54,059 INFO L93 Difference]: Finished difference Result 87180 states and 141178 transitions. [2024-11-19 00:03:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:03:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2024-11-19 00:03:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:54,273 INFO L225 Difference]: With dead ends: 87180 [2024-11-19 00:03:54,274 INFO L226 Difference]: Without dead ends: 53484 [2024-11-19 00:03:54,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:03:54,314 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 417 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:54,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1194 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:03:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53484 states.