./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-6.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-6.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 b1b5e238bcd4ee535bf9e96af21caceeb3a2a173bd89e8e32df2f3ba7f05dd4a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:05:23,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:05:23,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:05:23,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:05:23,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:05:23,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:05:23,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:05:23,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:05:23,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:05:23,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:05:23,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:05:23,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:05:23,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:05:23,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:05:23,383 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:05:23,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:05:23,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:05:23,384 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:05:23,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:05:23,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:05:23,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:05:23,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:05:23,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:05:23,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:05:23,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:05:23,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:05:23,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:05:23,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:05:23,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:05:23,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:05:23,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:05:23,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:05:23,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:23,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:05:23,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:05:23,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:05:23,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:05:23,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:05:23,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:05:23,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:05:23,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:05:23,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:05:23,394 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 -> b1b5e238bcd4ee535bf9e96af21caceeb3a2a173bd89e8e32df2f3ba7f05dd4a [2024-11-19 00:05:23,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:05:23,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:05:23,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:05:23,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:05:23,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:05:23,616 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-6.i [2024-11-19 00:05:24,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:05:25,153 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:05:25,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-6.i [2024-11-19 00:05:25,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f9b0c3b/c2744c62943e41f89e7b21a56d3062cf/FLAG61f558a3d [2024-11-19 00:05:25,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f9b0c3b/c2744c62943e41f89e7b21a56d3062cf [2024-11-19 00:05:25,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:05:25,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:05:25,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:25,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:05:25,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:05:25,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:25,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34169cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25, skipping insertion in model container [2024-11-19 00:05:25,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:25,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:05:25,403 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-6.i[915,928] [2024-11-19 00:05:25,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:25,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:05:25,648 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-6.i[915,928] [2024-11-19 00:05:25,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:25,789 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:05:25,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25 WrapperNode [2024-11-19 00:05:25,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:25,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:25,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:05:25,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:05:25,798 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:05:25" (1/1) ... [2024-11-19 00:05:25,824 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:05:25" (1/1) ... [2024-11-19 00:05:25,919 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 629 [2024-11-19 00:05:25,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:25,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:05:25,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:05:25,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:05:25,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:25,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:25,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,039 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:05:26,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:05:26,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:05:26,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:05:26,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:05:26,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (1/1) ... [2024-11-19 00:05:26,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:26,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:26,195 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:05:26,198 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:05:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:05:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:05:26,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:05:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:05:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:05:26,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:05:26,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:05:26,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:05:27,218 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-19 00:05:27,218 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:05:27,237 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:05:27,238 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:05:27,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:27 BoogieIcfgContainer [2024-11-19 00:05:27,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:05:27,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:05:27,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:05:27,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:05:27,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:05:25" (1/3) ... [2024-11-19 00:05:27,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795e70bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:27, skipping insertion in model container [2024-11-19 00:05:27,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:25" (2/3) ... [2024-11-19 00:05:27,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795e70bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:27, skipping insertion in model container [2024-11-19 00:05:27,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:27" (3/3) ... [2024-11-19 00:05:27,249 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-6.i [2024-11-19 00:05:27,264 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:05:27,264 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:05:27,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:05:27,344 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;@8c3755c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:05:27,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:05:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-19 00:05:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:27,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:27,379 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:27,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:27,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1265523210, now seen corresponding path program 1 times [2024-11-19 00:05:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433941897] [2024-11-19 00:05:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2024-11-19 00:05:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433941897] [2024-11-19 00:05:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433941897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:05:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494014403] [2024-11-19 00:05:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:05:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:27,978 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:05:27,984 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:05:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:28,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:05:28,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:05:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2024-11-19 00:05:28,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:05:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494014403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:05:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:05:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259871175] [2024-11-19 00:05:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:28,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:05:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:05:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:05:28,434 INFO L87 Difference]: Start difference. First operand has 237 states, 177 states have (on average 1.576271186440678) internal successors, (279), 178 states have internal predecessors, (279), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-19 00:05:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:28,476 INFO L93 Difference]: Finished difference Result 466 states and 835 transitions. [2024-11-19 00:05:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:05:28,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 408 [2024-11-19 00:05:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:28,486 INFO L225 Difference]: With dead ends: 466 [2024-11-19 00:05:28,486 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 00:05:28,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 409 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:05:28,494 INFO L432 NwaCegarLoop]: 383 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, 383 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:05:28,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 00:05:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-11-19 00:05:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 173 states have (on average 1.5549132947976878) internal successors, (269), 173 states have internal predecessors, (269), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-19 00:05:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 383 transitions. [2024-11-19 00:05:28,573 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 383 transitions. Word has length 408 [2024-11-19 00:05:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 383 transitions. [2024-11-19 00:05:28,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-19 00:05:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 383 transitions. [2024-11-19 00:05:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:28,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:28,583 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,599 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:05:28,785 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:05:28,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:28,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1431247416, now seen corresponding path program 1 times [2024-11-19 00:05:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:28,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567144310] [2024-11-19 00:05:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567144310] [2024-11-19 00:05:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567144310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:29,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:29,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:29,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344277711] [2024-11-19 00:05:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:29,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:29,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:29,148 INFO L87 Difference]: Start difference. First operand 232 states and 383 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:29,249 INFO L93 Difference]: Finished difference Result 653 states and 1079 transitions. [2024-11-19 00:05:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:29,257 INFO L225 Difference]: With dead ends: 653 [2024-11-19 00:05:29,257 INFO L226 Difference]: Without dead ends: 424 [2024-11-19 00:05:29,258 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:05:29,260 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 307 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:29,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 841 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-19 00:05:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2024-11-19 00:05:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 322 states have (on average 1.5590062111801242) internal successors, (502), 323 states have internal predecessors, (502), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:05:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 694 transitions. [2024-11-19 00:05:29,307 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 694 transitions. Word has length 408 [2024-11-19 00:05:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:29,310 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 694 transitions. [2024-11-19 00:05:29,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 694 transitions. [2024-11-19 00:05:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:29,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:29,316 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:05:29,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:29,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash 373409338, now seen corresponding path program 1 times [2024-11-19 00:05:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:29,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631975761] [2024-11-19 00:05:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631975761] [2024-11-19 00:05:29,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631975761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:29,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:29,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173375515] [2024-11-19 00:05:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:29,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:29,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:29,616 INFO L87 Difference]: Start difference. First operand 421 states and 694 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:29,712 INFO L93 Difference]: Finished difference Result 1257 states and 2076 transitions. [2024-11-19 00:05:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:29,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:29,720 INFO L225 Difference]: With dead ends: 1257 [2024-11-19 00:05:29,720 INFO L226 Difference]: Without dead ends: 839 [2024-11-19 00:05:29,722 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:05:29,723 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 374 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:29,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 976 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-19 00:05:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2024-11-19 00:05:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 640 states have (on average 1.55) internal successors, (992), 642 states have internal predecessors, (992), 192 states have call successors, (192), 4 states have call predecessors, (192), 4 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-19 00:05:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1376 transitions. [2024-11-19 00:05:29,781 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1376 transitions. Word has length 408 [2024-11-19 00:05:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1376 transitions. [2024-11-19 00:05:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1376 transitions. [2024-11-19 00:05:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:29,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:29,787 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:05:29,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:29,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 854489596, now seen corresponding path program 1 times [2024-11-19 00:05:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516192516] [2024-11-19 00:05:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516192516] [2024-11-19 00:05:30,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516192516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:30,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:30,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839972467] [2024-11-19 00:05:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:30,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:30,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:30,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:30,084 INFO L87 Difference]: Start difference. First operand 837 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:30,218 INFO L93 Difference]: Finished difference Result 2497 states and 4106 transitions. [2024-11-19 00:05:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:30,231 INFO L225 Difference]: With dead ends: 2497 [2024-11-19 00:05:30,231 INFO L226 Difference]: Without dead ends: 1663 [2024-11-19 00:05:30,234 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:05:30,239 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 362 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:30,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 996 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-19 00:05:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 915. [2024-11-19 00:05:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 718 states have (on average 1.5571030640668524) internal successors, (1118), 720 states have internal predecessors, (1118), 192 states have call successors, (192), 4 states have call predecessors, (192), 4 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-19 00:05:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1502 transitions. [2024-11-19 00:05:30,362 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1502 transitions. Word has length 408 [2024-11-19 00:05:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:30,363 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1502 transitions. [2024-11-19 00:05:30,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1502 transitions. [2024-11-19 00:05:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:30,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:30,375 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:30,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:05:30,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:30,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:30,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1556089470, now seen corresponding path program 1 times [2024-11-19 00:05:30,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:30,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576244521] [2024-11-19 00:05:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576244521] [2024-11-19 00:05:30,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576244521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:30,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599064169] [2024-11-19 00:05:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:30,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:30,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:30,678 INFO L87 Difference]: Start difference. First operand 915 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:30,876 INFO L93 Difference]: Finished difference Result 2711 states and 4444 transitions. [2024-11-19 00:05:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:30,885 INFO L225 Difference]: With dead ends: 2711 [2024-11-19 00:05:30,885 INFO L226 Difference]: Without dead ends: 1799 [2024-11-19 00:05:30,888 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:05:30,888 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 311 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:30,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 718 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-11-19 00:05:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1797. [2024-11-19 00:05:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1404 states have (on average 1.5256410256410255) internal successors, (2142), 1408 states have internal predecessors, (2142), 384 states have call successors, (384), 8 states have call predecessors, (384), 8 states have return successors, (384), 380 states have call predecessors, (384), 384 states have call successors, (384) [2024-11-19 00:05:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2910 transitions. [2024-11-19 00:05:30,993 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2910 transitions. Word has length 408 [2024-11-19 00:05:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:30,994 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2910 transitions. [2024-11-19 00:05:30,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2910 transitions. [2024-11-19 00:05:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:31,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:31,000 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:05:31,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:31,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1293809282, now seen corresponding path program 1 times [2024-11-19 00:05:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99239512] [2024-11-19 00:05:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99239512] [2024-11-19 00:05:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99239512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:31,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210842119] [2024-11-19 00:05:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:31,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:31,277 INFO L87 Difference]: Start difference. First operand 1797 states and 2910 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:31,485 INFO L93 Difference]: Finished difference Result 5365 states and 8684 transitions. [2024-11-19 00:05:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:31,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:31,510 INFO L225 Difference]: With dead ends: 5365 [2024-11-19 00:05:31,511 INFO L226 Difference]: Without dead ends: 3571 [2024-11-19 00:05:31,519 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:05:31,520 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 367 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:31,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 749 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2024-11-19 00:05:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3177. [2024-11-19 00:05:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 2392 states have (on average 1.4987458193979932) internal successors, (3585), 2400 states have internal predecessors, (3585), 768 states have call successors, (768), 16 states have call predecessors, (768), 16 states have return successors, (768), 760 states have call predecessors, (768), 768 states have call successors, (768) [2024-11-19 00:05:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 5121 transitions. [2024-11-19 00:05:31,860 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 5121 transitions. Word has length 408 [2024-11-19 00:05:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 3177 states and 5121 transitions. [2024-11-19 00:05:31,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 5121 transitions. [2024-11-19 00:05:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:31,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:31,865 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:05:31,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:31,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1990040764, now seen corresponding path program 1 times [2024-11-19 00:05:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544483688] [2024-11-19 00:05:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544483688] [2024-11-19 00:05:32,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544483688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:32,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:32,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:05:32,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280947805] [2024-11-19 00:05:32,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:32,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:05:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:05:32,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:32,530 INFO L87 Difference]: Start difference. First operand 3177 states and 5121 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:32,889 INFO L93 Difference]: Finished difference Result 7708 states and 12406 transitions. [2024-11-19 00:05:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:05:32,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:32,912 INFO L225 Difference]: With dead ends: 7708 [2024-11-19 00:05:32,912 INFO L226 Difference]: Without dead ends: 4534 [2024-11-19 00:05:32,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:05:32,923 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 316 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:32,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1502 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:05:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2024-11-19 00:05:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 3281. [2024-11-19 00:05:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 2437 states have (on average 1.4903569963069347) internal successors, (3632), 2445 states have internal predecessors, (3632), 825 states have call successors, (825), 18 states have call predecessors, (825), 18 states have return successors, (825), 817 states have call predecessors, (825), 825 states have call successors, (825) [2024-11-19 00:05:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5282 transitions. [2024-11-19 00:05:33,215 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5282 transitions. Word has length 408 [2024-11-19 00:05:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:33,216 INFO L471 AbstractCegarLoop]: Abstraction has 3281 states and 5282 transitions. [2024-11-19 00:05:33,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5282 transitions. [2024-11-19 00:05:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:05:33,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:33,220 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:33,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:05:33,220 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash -607304994, now seen corresponding path program 1 times [2024-11-19 00:05:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352969357] [2024-11-19 00:05:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352969357] [2024-11-19 00:05:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352969357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:33,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140259099] [2024-11-19 00:05:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:33,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:33,921 INFO L87 Difference]: Start difference. First operand 3281 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:34,195 INFO L93 Difference]: Finished difference Result 9445 states and 15229 transitions. [2024-11-19 00:05:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:34,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2024-11-19 00:05:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:34,226 INFO L225 Difference]: With dead ends: 9445 [2024-11-19 00:05:34,226 INFO L226 Difference]: Without dead ends: 6271 [2024-11-19 00:05:34,236 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:05:34,237 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 263 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:34,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 908 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2024-11-19 00:05:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 6205. [2024-11-19 00:05:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6205 states, 4577 states have (on average 1.4756390648896658) internal successors, (6754), 4593 states have internal predecessors, (6754), 1593 states have call successors, (1593), 34 states have call predecessors, (1593), 34 states have return successors, (1593), 1577 states have call predecessors, (1593), 1593 states have call successors, (1593) [2024-11-19 00:05:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 9940 transitions. [2024-11-19 00:05:34,548 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 9940 transitions. Word has length 409 [2024-11-19 00:05:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:34,549 INFO L471 AbstractCegarLoop]: Abstraction has 6205 states and 9940 transitions. [2024-11-19 00:05:34,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 9940 transitions. [2024-11-19 00:05:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-19 00:05:34,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:34,554 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:34,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:05:34,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1201866854, now seen corresponding path program 1 times [2024-11-19 00:05:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732645307] [2024-11-19 00:05:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:34,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732645307] [2024-11-19 00:05:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732645307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:35,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692724958] [2024-11-19 00:05:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:35,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:35,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:35,225 INFO L87 Difference]: Start difference. First operand 6205 states and 9940 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:35,625 INFO L93 Difference]: Finished difference Result 15353 states and 24622 transitions. [2024-11-19 00:05:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:35,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 410 [2024-11-19 00:05:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:35,697 INFO L225 Difference]: With dead ends: 15353 [2024-11-19 00:05:35,698 INFO L226 Difference]: Without dead ends: 9255 [2024-11-19 00:05:35,725 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:05:35,726 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 249 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:35,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 741 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states. [2024-11-19 00:05:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 9253. [2024-11-19 00:05:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9253 states, 6841 states have (on average 1.4753690980850753) internal successors, (10093), 6865 states have internal predecessors, (10093), 2361 states have call successors, (2361), 50 states have call predecessors, (2361), 50 states have return successors, (2361), 2337 states have call predecessors, (2361), 2361 states have call successors, (2361) [2024-11-19 00:05:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9253 states to 9253 states and 14815 transitions. [2024-11-19 00:05:36,483 INFO L78 Accepts]: Start accepts. Automaton has 9253 states and 14815 transitions. Word has length 410 [2024-11-19 00:05:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:36,484 INFO L471 AbstractCegarLoop]: Abstraction has 9253 states and 14815 transitions. [2024-11-19 00:05:36,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 9253 states and 14815 transitions. [2024-11-19 00:05:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-19 00:05:36,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:36,495 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:05:36,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:36,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash -160125800, now seen corresponding path program 1 times [2024-11-19 00:05:36,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:36,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323921801] [2024-11-19 00:05:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:37,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323921801] [2024-11-19 00:05:37,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323921801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:37,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:37,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252666779] [2024-11-19 00:05:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:37,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:37,316 INFO L87 Difference]: Start difference. First operand 9253 states and 14815 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:37,761 INFO L93 Difference]: Finished difference Result 18377 states and 29407 transitions. [2024-11-19 00:05:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:37,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 410 [2024-11-19 00:05:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:37,807 INFO L225 Difference]: With dead ends: 18377 [2024-11-19 00:05:37,808 INFO L226 Difference]: Without dead ends: 9231 [2024-11-19 00:05:37,841 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:05:37,842 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 155 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:37,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 809 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9231 states. [2024-11-19 00:05:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9231 to 9217. [2024-11-19 00:05:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9217 states, 6877 states have (on average 1.4746255634724443) internal successors, (10141), 6901 states have internal predecessors, (10141), 2277 states have call successors, (2277), 62 states have call predecessors, (2277), 62 states have return successors, (2277), 2253 states have call predecessors, (2277), 2277 states have call successors, (2277) [2024-11-19 00:05:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9217 states to 9217 states and 14695 transitions. [2024-11-19 00:05:38,435 INFO L78 Accepts]: Start accepts. Automaton has 9217 states and 14695 transitions. Word has length 410 [2024-11-19 00:05:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:38,436 INFO L471 AbstractCegarLoop]: Abstraction has 9217 states and 14695 transitions. [2024-11-19 00:05:38,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9217 states and 14695 transitions. [2024-11-19 00:05:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-19 00:05:38,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:38,442 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:38,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:05:38,443 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:38,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2049172832, now seen corresponding path program 1 times [2024-11-19 00:05:38,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:38,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930775624] [2024-11-19 00:05:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:38,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:40,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930775624] [2024-11-19 00:05:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930775624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:05:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872908765] [2024-11-19 00:05:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:05:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:05:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:40,142 INFO L87 Difference]: Start difference. First operand 9217 states and 14695 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:41,823 INFO L93 Difference]: Finished difference Result 30073 states and 47606 transitions. [2024-11-19 00:05:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:05:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 410 [2024-11-19 00:05:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:41,928 INFO L225 Difference]: With dead ends: 30073 [2024-11-19 00:05:41,928 INFO L226 Difference]: Without dead ends: 20963 [2024-11-19 00:05:41,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:05:41,969 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 514 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:41,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1344 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:05:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20963 states. [2024-11-19 00:05:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20963 to 16975. [2024-11-19 00:05:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16975 states, 12895 states have (on average 1.4829778984102364) internal successors, (19123), 12967 states have internal predecessors, (19123), 3957 states have call successors, (3957), 122 states have call predecessors, (3957), 122 states have return successors, (3957), 3885 states have call predecessors, (3957), 3957 states have call successors, (3957) [2024-11-19 00:05:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16975 states to 16975 states and 27037 transitions. [2024-11-19 00:05:43,256 INFO L78 Accepts]: Start accepts. Automaton has 16975 states and 27037 transitions. Word has length 410 [2024-11-19 00:05:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:43,258 INFO L471 AbstractCegarLoop]: Abstraction has 16975 states and 27037 transitions. [2024-11-19 00:05:43,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 16975 states and 27037 transitions. [2024-11-19 00:05:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-19 00:05:43,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:43,270 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:43,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:05:43,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:43,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1369114462, now seen corresponding path program 1 times [2024-11-19 00:05:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123135871] [2024-11-19 00:05:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:45,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123135871] [2024-11-19 00:05:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123135871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:05:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070816462] [2024-11-19 00:05:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:05:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:05:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:05:45,484 INFO L87 Difference]: Start difference. First operand 16975 states and 27037 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2024-11-19 00:05:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:48,569 INFO L93 Difference]: Finished difference Result 51099 states and 81074 transitions. [2024-11-19 00:05:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:05:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 410 [2024-11-19 00:05:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:48,714 INFO L225 Difference]: With dead ends: 51099 [2024-11-19 00:05:48,715 INFO L226 Difference]: Without dead ends: 34231 [2024-11-19 00:05:48,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:05:48,760 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1148 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:48,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 2455 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:05:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34231 states. [2024-11-19 00:05:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34231 to 34169. [2024-11-19 00:05:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34169 states, 25972 states have (on average 1.4760511319882952) internal successors, (38336), 26116 states have internal predecessors, (38336), 7857 states have call successors, (7857), 339 states have call predecessors, (7857), 339 states have return successors, (7857), 7713 states have call predecessors, (7857), 7857 states have call successors, (7857) [2024-11-19 00:05:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34169 states to 34169 states and 54050 transitions. [2024-11-19 00:05:51,794 INFO L78 Accepts]: Start accepts. Automaton has 34169 states and 54050 transitions. Word has length 410 [2024-11-19 00:05:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 34169 states and 54050 transitions. [2024-11-19 00:05:51,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2024-11-19 00:05:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 34169 states and 54050 transitions. [2024-11-19 00:05:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-19 00:05:51,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:51,812 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:05:51,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -843199396, now seen corresponding path program 1 times [2024-11-19 00:05:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479103762] [2024-11-19 00:05:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:53,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479103762] [2024-11-19 00:05:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479103762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:53,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:53,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360841160] [2024-11-19 00:05:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:53,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:53,198 INFO L87 Difference]: Start difference. First operand 34169 states and 54050 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:57,926 INFO L93 Difference]: Finished difference Result 111169 states and 175523 transitions. [2024-11-19 00:05:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 411 [2024-11-19 00:05:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:58,302 INFO L225 Difference]: With dead ends: 111169 [2024-11-19 00:05:58,302 INFO L226 Difference]: Without dead ends: 77109 [2024-11-19 00:05:58,532 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:05:58,534 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 552 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:58,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1125 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:05:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77109 states. [2024-11-19 00:06:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77109 to 67721. [2024-11-19 00:06:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67721 states, 51388 states have (on average 1.4690005448742898) internal successors, (75489), 51676 states have internal predecessors, (75489), 15657 states have call successors, (15657), 675 states have call predecessors, (15657), 675 states have return successors, (15657), 15369 states have call predecessors, (15657), 15657 states have call successors, (15657) [2024-11-19 00:06:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67721 states to 67721 states and 106803 transitions. [2024-11-19 00:06:03,850 INFO L78 Accepts]: Start accepts. Automaton has 67721 states and 106803 transitions. Word has length 411 [2024-11-19 00:06:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:03,850 INFO L471 AbstractCegarLoop]: Abstraction has 67721 states and 106803 transitions. [2024-11-19 00:06:03,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:06:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67721 states and 106803 transitions. [2024-11-19 00:06:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-19 00:06:03,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:03,878 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:03,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:06:03,879 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:03,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1429475618, now seen corresponding path program 1 times [2024-11-19 00:06:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311009472] [2024-11-19 00:06:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:06:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:06,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311009472] [2024-11-19 00:06:06,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311009472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:06,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:06,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:06:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436217398] [2024-11-19 00:06:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:06,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:06:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:06:06,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:06:06,142 INFO L87 Difference]: Start difference. First operand 67721 states and 106803 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57)