./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.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 ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:06:57,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:06:58,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:06:58,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:06:58,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:06:58,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:06:58,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:06:58,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:06:58,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:06:58,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:06:58,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:06:58,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:06:58,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:06:58,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:06:58,069 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:06:58,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:06:58,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:06:58,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:06:58,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:06:58,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:06:58,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:06:58,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:06:58,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:06:58,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:06:58,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:06:58,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:06:58,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:06:58,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:06:58,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:06:58,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:06:58,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:06:58,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:06:58,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:06:58,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:06:58,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:06:58,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:06:58,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:06:58,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:06:58,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:06:58,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:06:58,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:06:58,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:06:58,075 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 -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2024-10-13 03:06:58,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:06:58,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:06:58,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:06:58,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:06:58,331 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:06:58,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-13 03:06:59,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:06:59,726 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:06:59,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-13 03:06:59,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aea3e7bc/ae0dcca9ed0a40f3b14e486f10dea0a9/FLAG20688c6c5 [2024-10-13 03:07:00,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aea3e7bc/ae0dcca9ed0a40f3b14e486f10dea0a9 [2024-10-13 03:07:00,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:07:00,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:07:00,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:07:00,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:07:00,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:07:00,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395ce8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00, skipping insertion in model container [2024-10-13 03:07:00,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:07:00,285 WARN L248 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_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-10-13 03:07:00,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:07:00,374 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:07:00,383 WARN L248 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_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-10-13 03:07:00,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:07:00,424 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:07:00,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00 WrapperNode [2024-10-13 03:07:00,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:07:00,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:07:00,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:07:00,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:07:00,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,500 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-13 03:07:00,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:07:00,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:07:00,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:07:00,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:07:00,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,541 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-10-13 03:07:00,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:07:00,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:07:00,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:07:00,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:07:00,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (1/1) ... [2024-10-13 03:07:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:07:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:07:00,593 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-10-13 03:07:00,595 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-10-13 03:07:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:07:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:07:00,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:07:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:07:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:07:00,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:07:00,695 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:07:00,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:07:01,025 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 03:07:01,025 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:07:01,064 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:07:01,064 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:07:01,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:07:01 BoogieIcfgContainer [2024-10-13 03:07:01,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:07:01,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:07:01,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:07:01,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:07:01,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:07:00" (1/3) ... [2024-10-13 03:07:01,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a776c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:07:01, skipping insertion in model container [2024-10-13 03:07:01,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:07:00" (2/3) ... [2024-10-13 03:07:01,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a776c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:07:01, skipping insertion in model container [2024-10-13 03:07:01,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:07:01" (3/3) ... [2024-10-13 03:07:01,071 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-13 03:07:01,083 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:07:01,083 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:07:01,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:07:01,133 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;@74f80125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:07:01,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:07:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 03:07:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 03:07:01,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:07:01,149 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:07:01,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:07:01,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:07:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash -649338097, now seen corresponding path program 1 times [2024-10-13 03:07:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:07:01,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529211716] [2024-10-13 03:07:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:07:01,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:07:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:07:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:07:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:07:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:07:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:07:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:07:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:07:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:07:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:07:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:07:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:07:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:07:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:07:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:07:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:07:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:07:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:07:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:07:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:07:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:07:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:07:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:07:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:07:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:07:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:07:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:07:01,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529211716] [2024-10-13 03:07:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529211716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:07:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:07:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:07:01,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562175049] [2024-10-13 03:07:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:07:01,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:07:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:07:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:07:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:07:01,541 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 03:07:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:07:01,577 INFO L93 Difference]: Finished difference Result 155 states and 278 transitions. [2024-10-13 03:07:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:07:01,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-10-13 03:07:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:07:01,587 INFO L225 Difference]: With dead ends: 155 [2024-10-13 03:07:01,590 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 03:07:01,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10-13 03:07:01,608 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:07:01,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:07:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 03:07:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 03:07:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 03:07:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2024-10-13 03:07:01,640 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 123 transitions. Word has length 157 [2024-10-13 03:07:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:07:01,640 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-13 03:07:01,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 03:07:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2024-10-13 03:07:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 03:07:01,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:07:01,646 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:07:01,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:07:01,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:07:01,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:07:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1055475765, now seen corresponding path program 1 times [2024-10-13 03:07:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:07:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089108806] [2024-10-13 03:07:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:07:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:07:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:07:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:07:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:07:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:07:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:07:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:07:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:07:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:07:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:07:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:07:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:07:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:07:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:07:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:07:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:07:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:07:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:07:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:07:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:07:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:07:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:07:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:07:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:07:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:07:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:07:01,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:07:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089108806] [2024-10-13 03:07:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089108806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:07:01,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:07:01,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:07:01,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89519641] [2024-10-13 03:07:01,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:07:01,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:07:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:07:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:07:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:07:01,955 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:07:02,018 INFO L93 Difference]: Finished difference Result 229 states and 367 transitions. [2024-10-13 03:07:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:07:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-13 03:07:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:07:02,024 INFO L225 Difference]: With dead ends: 229 [2024-10-13 03:07:02,024 INFO L226 Difference]: Without dead ends: 153 [2024-10-13 03:07:02,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-10-13 03:07:02,025 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 80 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:07:02,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 237 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:07:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-13 03:07:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-10-13 03:07:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.47) internal successors, (147), 100 states have internal predecessors, (147), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 03:07:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 243 transitions. [2024-10-13 03:07:02,061 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 243 transitions. Word has length 157 [2024-10-13 03:07:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:07:02,061 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 243 transitions. [2024-10-13 03:07:02,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 243 transitions. [2024-10-13 03:07:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 03:07:02,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:07:02,067 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:07:02,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:07:02,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:07:02,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:07:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1873124215, now seen corresponding path program 1 times [2024-10-13 03:07:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:07:02,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380985545] [2024-10-13 03:07:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:07:02,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:07:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:07:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:07:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:07:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:07:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:07:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:07:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:07:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:07:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:07:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:07:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:07:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:07:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:07:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:07:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:07:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:07:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:07:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:07:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:07:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:07:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:07:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:07:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:07:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:07:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:07:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:07:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380985545] [2024-10-13 03:07:02,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380985545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:07:02,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:07:02,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:07:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975145826] [2024-10-13 03:07:02,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:07:02,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:07:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:07:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:07:02,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:07:02,361 INFO L87 Difference]: Start difference. First operand 151 states and 243 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:07:02,665 INFO L93 Difference]: Finished difference Result 547 states and 884 transitions. [2024-10-13 03:07:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:07:02,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-13 03:07:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:07:02,669 INFO L225 Difference]: With dead ends: 547 [2024-10-13 03:07:02,671 INFO L226 Difference]: Without dead ends: 397 [2024-10-13 03:07:02,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-10-13 03:07:02,673 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 203 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:07:02,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 402 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:07:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-13 03:07:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2024-10-13 03:07:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 216 states have (on average 1.412037037037037) internal successors, (305), 216 states have internal predecessors, (305), 120 states have call successors, (120), 5 states have call predecessors, (120), 5 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 03:07:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 545 transitions. [2024-10-13 03:07:02,721 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 545 transitions. Word has length 157 [2024-10-13 03:07:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:07:02,721 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 545 transitions. [2024-10-13 03:07:02,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 545 transitions. [2024-10-13 03:07:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 03:07:02,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:07:02,724 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:07:02,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:07:02,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:07:02,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:07:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1692744837, now seen corresponding path program 1 times [2024-10-13 03:07:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:07:02,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771350433] [2024-10-13 03:07:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:07:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:07:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:07:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:07:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:07:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:07:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:07:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:07:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:07:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:07:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:07:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:07:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:07:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:07:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:07:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:07:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:07:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:07:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:07:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:07:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:07:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:02,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:07:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:07:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:07:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:07:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:07:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:07:03,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:07:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771350433] [2024-10-13 03:07:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771350433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:07:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:07:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:07:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142596206] [2024-10-13 03:07:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:07:03,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:07:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:07:03,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:07:03,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:07:03,041 INFO L87 Difference]: Start difference. First operand 342 states and 545 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:07:03,114 INFO L93 Difference]: Finished difference Result 510 states and 819 transitions. [2024-10-13 03:07:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:07:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-13 03:07:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:07:03,117 INFO L225 Difference]: With dead ends: 510 [2024-10-13 03:07:03,119 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 03:07:03,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-10-13 03:07:03,121 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 59 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:07:03,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 211 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:07:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 03:07:03,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2024-10-13 03:07:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 122 states have (on average 1.401639344262295) internal successors, (171), 122 states have internal predecessors, (171), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 03:07:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2024-10-13 03:07:03,148 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 158 [2024-10-13 03:07:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:07:03,148 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2024-10-13 03:07:03,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2024-10-13 03:07:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 03:07:03,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:07:03,150 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:07:03,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:07:03,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:07:03,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:07:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash -247709273, now seen corresponding path program 1 times [2024-10-13 03:07:03,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:07:03,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968352924] [2024-10-13 03:07:03,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:07:03,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:07:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:07:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:07:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:07:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:07:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:07:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:07:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:07:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:07:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:07:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:07:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:07:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:07:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:07:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:07:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:07:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:07:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:07:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:07:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:07:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:07:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:07:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:07:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:07:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:07:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:07:25,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:07:25,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968352924] [2024-10-13 03:07:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968352924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:07:25,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:07:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:07:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93641039] [2024-10-13 03:07:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:07:25,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:07:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:07:25,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:07:25,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:07:25,451 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:07:26,141 INFO L93 Difference]: Finished difference Result 508 states and 793 transitions. [2024-10-13 03:07:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 03:07:26,141 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-13 03:07:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:07:26,144 INFO L225 Difference]: With dead ends: 508 [2024-10-13 03:07:26,144 INFO L226 Difference]: Without dead ends: 358 [2024-10-13 03:07:26,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:07:26,145 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 193 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:07:26,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 446 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:07:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-13 03:07:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 268. [2024-10-13 03:07:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.434065934065934) internal successors, (261), 184 states have internal predecessors, (261), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 03:07:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 421 transitions. [2024-10-13 03:07:26,162 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 421 transitions. Word has length 158 [2024-10-13 03:07:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:07:26,163 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 421 transitions. [2024-10-13 03:07:26,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 421 transitions. [2024-10-13 03:07:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 03:07:26,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:07:26,165 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:07:26,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:07:26,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:07:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:07:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash -247649691, now seen corresponding path program 1 times [2024-10-13 03:07:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:07:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375824313] [2024-10-13 03:07:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:07:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:07:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:07:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:07:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:07:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:07:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:07:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:07:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:07:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:07:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:07:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:07:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:07:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:07:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:07:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:07:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:07:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:07:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:07:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:07:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:07:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:07:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:07:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:50,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:07:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:51,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:07:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:51,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:07:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:07:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:07:51,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:07:51,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375824313] [2024-10-13 03:07:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375824313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:07:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:07:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:07:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862523039] [2024-10-13 03:07:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:07:51,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:07:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:07:51,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:07:51,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:07:51,007 INFO L87 Difference]: Start difference. First operand 268 states and 421 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:07:51,649 INFO L93 Difference]: Finished difference Result 347 states and 525 transitions. [2024-10-13 03:07:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 03:07:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-13 03:07:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:07:51,651 INFO L225 Difference]: With dead ends: 347 [2024-10-13 03:07:51,651 INFO L226 Difference]: Without dead ends: 345 [2024-10-13 03:07:51,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:07:51,652 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 171 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:07:51,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 556 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 03:07:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-13 03:07:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 268. [2024-10-13 03:07:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.434065934065934) internal successors, (261), 184 states have internal predecessors, (261), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 03:07:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 421 transitions. [2024-10-13 03:07:51,672 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 421 transitions. Word has length 158 [2024-10-13 03:07:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:07:51,673 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 421 transitions. [2024-10-13 03:07:51,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:07:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 421 transitions. [2024-10-13 03:07:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 03:07:51,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:07:51,674 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:07:51,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:07:51,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:07:51,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:07:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1057055899, now seen corresponding path program 1 times [2024-10-13 03:07:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:07:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065985741] [2024-10-13 03:07:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:07:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:07:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:08:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:08:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:08:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:08:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:08:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:08:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:08:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:08:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:08:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:08:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:08:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:08:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:08:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:08:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:08:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:08:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:08:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:08:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:08:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:08:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:08:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:08:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 03:08:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 03:08:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:08:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:08:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:08:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065985741] [2024-10-13 03:08:23,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065985741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:08:23,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:08:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:08:23,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933595163] [2024-10-13 03:08:23,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:08:23,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:08:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:08:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:08:23,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:08:23,797 INFO L87 Difference]: Start difference. First operand 268 states and 421 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:08:25,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 03:08:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:08:26,552 INFO L93 Difference]: Finished difference Result 327 states and 499 transitions. [2024-10-13 03:08:26,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 03:08:26,552 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-13 03:08:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:08:26,555 INFO L225 Difference]: With dead ends: 327 [2024-10-13 03:08:26,555 INFO L226 Difference]: Without dead ends: 325 [2024-10-13 03:08:26,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:08:26,556 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 154 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:08:26,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 414 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 03:08:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-13 03:08:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 273. [2024-10-13 03:08:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 187 states have (on average 1.4331550802139037) internal successors, (268), 189 states have internal predecessors, (268), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 03:08:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 428 transitions. [2024-10-13 03:08:26,571 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 428 transitions. Word has length 158 [2024-10-13 03:08:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:08:26,571 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 428 transitions. [2024-10-13 03:08:26,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 03:08:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 428 transitions. [2024-10-13 03:08:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 03:08:26,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:08:26,574 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:08:26,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:08:26,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:08:26,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:08:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1056996317, now seen corresponding path program 1 times [2024-10-13 03:08:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:08:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80159830] [2024-10-13 03:08:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:08:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:08:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat