./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -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 a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:26:58,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:26:58,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:26:58,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:26:58,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:26:58,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:26:58,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:26:58,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:26:58,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:26:58,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:26:58,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:26:58,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:26:58,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:26:58,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:26:58,201 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:26:58,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:26:58,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:26:58,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:26:58,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:26:58,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:26:58,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:26:58,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:26:58,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:26:58,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:26:58,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:26:58,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:26:58,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:26:58,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:26:58,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:26:58,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:26:58,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:26:58,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:26:58,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:26:58,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:26:58,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:26:58,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:26:58,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:26:58,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:26:58,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:26:58,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:26:58,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:26:58,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:26:58,210 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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 [2024-10-24 01:26:58,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:26:58,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:26:58,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:26:58,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:26:58,479 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:26:58,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-10-24 01:26:59,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:27:00,104 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:27:00,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-10-24 01:27:00,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acec5955b/1b4922dd748f4376988bb7efbcacf1ed/FLAGa1660e7b4 [2024-10-24 01:27:00,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acec5955b/1b4922dd748f4376988bb7efbcacf1ed [2024-10-24 01:27:00,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:27:00,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:27:00,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:27:00,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:27:00,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:27:00,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:00,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2197a04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00, skipping insertion in model container [2024-10-24 01:27:00,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:00,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:27:00,793 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/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-10-24 01:27:00,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:27:00,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:27:00,865 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/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-10-24 01:27:00,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:27:00,895 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:27:00,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00 WrapperNode [2024-10-24 01:27:00,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:27:00,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:27:00,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:27:00,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:27:00,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:00,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:00,968 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 498 [2024-10-24 01:27:00,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:27:00,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:27:00,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:27:00,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:27:00,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:00,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:00,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,011 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-24 01:27:01,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:27:01,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:27:01,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:27:01,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:27:01,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (1/1) ... [2024-10-24 01:27:01,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:27:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:27:01,103 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-24 01:27:01,107 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-24 01:27:01,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:27:01,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:27:01,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:27:01,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:27:01,274 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:27:01,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:27:01,916 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-24 01:27:01,916 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:27:01,971 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:27:01,971 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:27:01,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:27:01 BoogieIcfgContainer [2024-10-24 01:27:01,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:27:01,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:27:01,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:27:01,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:27:01,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:27:00" (1/3) ... [2024-10-24 01:27:01,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2911b949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:27:01, skipping insertion in model container [2024-10-24 01:27:01,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:27:00" (2/3) ... [2024-10-24 01:27:01,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2911b949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:27:01, skipping insertion in model container [2024-10-24 01:27:01,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:27:01" (3/3) ... [2024-10-24 01:27:01,983 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-10-24 01:27:01,999 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:27:01,999 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:27:02,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:27:02,058 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;@52748753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:27:02,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:27:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:27:02,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:02,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:02,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:02,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 224379031, now seen corresponding path program 1 times [2024-10-24 01:27:02,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:02,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824631879] [2024-10-24 01:27:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:02,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824631879] [2024-10-24 01:27:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824631879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:02,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:02,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:27:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120704172] [2024-10-24 01:27:02,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:02,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:27:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:27:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:27:02,542 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:02,598 INFO L93 Difference]: Finished difference Result 205 states and 361 transitions. [2024-10-24 01:27:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:27:02,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-24 01:27:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:02,610 INFO L225 Difference]: With dead ends: 205 [2024-10-24 01:27:02,611 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 01:27:02,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-24 01:27:02,616 INFO L432 NwaCegarLoop]: 226 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, 226 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-24 01:27:02,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 01:27:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 01:27:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.7751937984496124) internal successors, (229), 129 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 229 transitions. [2024-10-24 01:27:02,656 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 229 transitions. Word has length 34 [2024-10-24 01:27:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:02,657 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 229 transitions. [2024-10-24 01:27:02,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 229 transitions. [2024-10-24 01:27:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:27:02,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:02,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:02,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:27:02,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:02,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1464564711, now seen corresponding path program 1 times [2024-10-24 01:27:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:02,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395634536] [2024-10-24 01:27:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:02,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:02,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395634536] [2024-10-24 01:27:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395634536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:02,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:02,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:02,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416247100] [2024-10-24 01:27:02,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:02,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:02,946 INFO L87 Difference]: Start difference. First operand 130 states and 229 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:03,059 INFO L93 Difference]: Finished difference Result 205 states and 355 transitions. [2024-10-24 01:27:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:03,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-24 01:27:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:03,062 INFO L225 Difference]: With dead ends: 205 [2024-10-24 01:27:03,063 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 01:27:03,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:03,067 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:03,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 01:27:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 01:27:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.5426356589147288) internal successors, (199), 129 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-10-24 01:27:03,080 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 34 [2024-10-24 01:27:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:03,080 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-10-24 01:27:03,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-10-24 01:27:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:27:03,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:03,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:03,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:27:03,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:03,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1940708535, now seen corresponding path program 1 times [2024-10-24 01:27:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:03,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473302017] [2024-10-24 01:27:03,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:03,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:03,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473302017] [2024-10-24 01:27:03,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473302017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545295149] [2024-10-24 01:27:03,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:03,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:03,275 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:03,356 INFO L93 Difference]: Finished difference Result 264 states and 427 transitions. [2024-10-24 01:27:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:03,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 01:27:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:03,358 INFO L225 Difference]: With dead ends: 264 [2024-10-24 01:27:03,360 INFO L226 Difference]: Without dead ends: 192 [2024-10-24 01:27:03,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:03,362 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 96 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:03,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 344 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-24 01:27:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-10-24 01:27:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.574468085106383) internal successors, (296), 188 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 296 transitions. [2024-10-24 01:27:03,380 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 296 transitions. Word has length 63 [2024-10-24 01:27:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:03,380 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 296 transitions. [2024-10-24 01:27:03,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 296 transitions. [2024-10-24 01:27:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 01:27:03,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:03,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:03,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:27:03,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:03,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1714080695, now seen corresponding path program 1 times [2024-10-24 01:27:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:03,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020400818] [2024-10-24 01:27:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020400818] [2024-10-24 01:27:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020400818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:03,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:03,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:03,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065000434] [2024-10-24 01:27:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:03,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:03,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:03,537 INFO L87 Difference]: Start difference. First operand 189 states and 296 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:03,576 INFO L93 Difference]: Finished difference Result 435 states and 708 transitions. [2024-10-24 01:27:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-24 01:27:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:03,581 INFO L225 Difference]: With dead ends: 435 [2024-10-24 01:27:03,583 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 01:27:03,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:03,585 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 98 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:03,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 357 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 01:27:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2024-10-24 01:27:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.608695652173913) internal successors, (481), 299 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 481 transitions. [2024-10-24 01:27:03,615 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 481 transitions. Word has length 65 [2024-10-24 01:27:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:03,618 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 481 transitions. [2024-10-24 01:27:03,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 481 transitions. [2024-10-24 01:27:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 01:27:03,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:03,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:03,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:27:03,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:03,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1557818661, now seen corresponding path program 1 times [2024-10-24 01:27:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:03,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137504930] [2024-10-24 01:27:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:03,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137504930] [2024-10-24 01:27:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137504930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:03,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219618391] [2024-10-24 01:27:03,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:03,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:03,771 INFO L87 Difference]: Start difference. First operand 300 states and 481 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:03,806 INFO L93 Difference]: Finished difference Result 752 states and 1235 transitions. [2024-10-24 01:27:03,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:03,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-24 01:27:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:03,810 INFO L225 Difference]: With dead ends: 752 [2024-10-24 01:27:03,810 INFO L226 Difference]: Without dead ends: 510 [2024-10-24 01:27:03,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:03,814 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 92 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:03,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-24 01:27:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 504. [2024-10-24 01:27:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.6242544731610338) internal successors, (817), 503 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 817 transitions. [2024-10-24 01:27:03,834 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 817 transitions. Word has length 67 [2024-10-24 01:27:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:03,834 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 817 transitions. [2024-10-24 01:27:03,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 817 transitions. [2024-10-24 01:27:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:27:03,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:03,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:03,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:27:03,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:03,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1377171565, now seen corresponding path program 1 times [2024-10-24 01:27:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921057278] [2024-10-24 01:27:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:04,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:04,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921057278] [2024-10-24 01:27:04,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921057278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:04,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:04,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:04,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696340178] [2024-10-24 01:27:04,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:04,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:04,035 INFO L87 Difference]: Start difference. First operand 504 states and 817 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:04,225 INFO L93 Difference]: Finished difference Result 2152 states and 3595 transitions. [2024-10-24 01:27:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:27:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-24 01:27:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:04,233 INFO L225 Difference]: With dead ends: 2152 [2024-10-24 01:27:04,234 INFO L226 Difference]: Without dead ends: 1706 [2024-10-24 01:27:04,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:27:04,238 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 803 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:04,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1126 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-24 01:27:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 895. [2024-10-24 01:27:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.6409395973154361) internal successors, (1467), 894 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1467 transitions. [2024-10-24 01:27:04,283 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1467 transitions. Word has length 69 [2024-10-24 01:27:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:04,285 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1467 transitions. [2024-10-24 01:27:04,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1467 transitions. [2024-10-24 01:27:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 01:27:04,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:04,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:27:04,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:04,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash -320075454, now seen corresponding path program 1 times [2024-10-24 01:27:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640455672] [2024-10-24 01:27:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:04,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:04,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640455672] [2024-10-24 01:27:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640455672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709757587] [2024-10-24 01:27:04,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:04,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:04,407 INFO L87 Difference]: Start difference. First operand 895 states and 1467 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:04,500 INFO L93 Difference]: Finished difference Result 2608 states and 4348 transitions. [2024-10-24 01:27:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:04,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-24 01:27:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:04,508 INFO L225 Difference]: With dead ends: 2608 [2024-10-24 01:27:04,508 INFO L226 Difference]: Without dead ends: 1771 [2024-10-24 01:27:04,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 01:27:04,510 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 355 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:04,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 566 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-10-24 01:27:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1324. [2024-10-24 01:27:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.6500377928949357) internal successors, (2183), 1323 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2183 transitions. [2024-10-24 01:27:04,552 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2183 transitions. Word has length 70 [2024-10-24 01:27:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:04,552 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2183 transitions. [2024-10-24 01:27:04,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2183 transitions. [2024-10-24 01:27:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:27:04,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:04,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:04,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:27:04,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:04,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1389673738, now seen corresponding path program 1 times [2024-10-24 01:27:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:04,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017495191] [2024-10-24 01:27:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:04,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017495191] [2024-10-24 01:27:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017495191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:04,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710481570] [2024-10-24 01:27:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:04,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:04,673 INFO L87 Difference]: Start difference. First operand 1324 states and 2183 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:04,797 INFO L93 Difference]: Finished difference Result 3842 states and 6392 transitions. [2024-10-24 01:27:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:04,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-24 01:27:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:04,808 INFO L225 Difference]: With dead ends: 3842 [2024-10-24 01:27:04,808 INFO L226 Difference]: Without dead ends: 2576 [2024-10-24 01:27:04,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 01:27:04,811 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 353 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:04,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 640 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2024-10-24 01:27:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1938. [2024-10-24 01:27:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1937 states have (on average 1.6484254001032526) internal successors, (3193), 1937 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3193 transitions. [2024-10-24 01:27:04,877 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3193 transitions. Word has length 71 [2024-10-24 01:27:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:04,877 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 3193 transitions. [2024-10-24 01:27:04,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3193 transitions. [2024-10-24 01:27:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 01:27:04,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:04,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:27:04,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:04,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -182030421, now seen corresponding path program 1 times [2024-10-24 01:27:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127759178] [2024-10-24 01:27:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:04,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127759178] [2024-10-24 01:27:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127759178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81294957] [2024-10-24 01:27:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:04,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:04,980 INFO L87 Difference]: Start difference. First operand 1938 states and 3193 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:05,097 INFO L93 Difference]: Finished difference Result 5598 states and 9288 transitions. [2024-10-24 01:27:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:05,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-24 01:27:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:05,114 INFO L225 Difference]: With dead ends: 5598 [2024-10-24 01:27:05,114 INFO L226 Difference]: Without dead ends: 3718 [2024-10-24 01:27:05,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 01:27:05,120 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 351 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:05,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 647 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2024-10-24 01:27:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 2812. [2024-10-24 01:27:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 1.6453219494841693) internal successors, (4625), 2811 states have internal predecessors, (4625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4625 transitions. [2024-10-24 01:27:05,205 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4625 transitions. Word has length 72 [2024-10-24 01:27:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:05,206 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4625 transitions. [2024-10-24 01:27:05,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4625 transitions. [2024-10-24 01:27:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:27:05,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:05,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:27:05,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash 756120180, now seen corresponding path program 1 times [2024-10-24 01:27:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466682783] [2024-10-24 01:27:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:05,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466682783] [2024-10-24 01:27:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466682783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:05,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70755084] [2024-10-24 01:27:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:05,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:05,286 INFO L87 Difference]: Start difference. First operand 2812 states and 4625 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:05,362 INFO L93 Difference]: Finished difference Result 6438 states and 10592 transitions. [2024-10-24 01:27:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:05,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:27:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:05,379 INFO L225 Difference]: With dead ends: 6438 [2024-10-24 01:27:05,379 INFO L226 Difference]: Without dead ends: 4432 [2024-10-24 01:27:05,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:05,384 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 91 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:05,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2024-10-24 01:27:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 4430. [2024-10-24 01:27:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 4429 states have (on average 1.6297132535561074) internal successors, (7218), 4429 states have internal predecessors, (7218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 7218 transitions. [2024-10-24 01:27:05,496 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 7218 transitions. Word has length 73 [2024-10-24 01:27:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:05,497 INFO L471 AbstractCegarLoop]: Abstraction has 4430 states and 7218 transitions. [2024-10-24 01:27:05,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 7218 transitions. [2024-10-24 01:27:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:27:05,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:05,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:05,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:27:05,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997516, now seen corresponding path program 1 times [2024-10-24 01:27:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570699265] [2024-10-24 01:27:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:05,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:05,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:05,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570699265] [2024-10-24 01:27:05,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570699265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:05,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:05,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:05,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298519824] [2024-10-24 01:27:05,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:05,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:05,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:05,562 INFO L87 Difference]: Start difference. First operand 4430 states and 7218 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:05,687 INFO L93 Difference]: Finished difference Result 9738 states and 15916 transitions. [2024-10-24 01:27:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:27:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:05,710 INFO L225 Difference]: With dead ends: 9738 [2024-10-24 01:27:05,710 INFO L226 Difference]: Without dead ends: 6598 [2024-10-24 01:27:05,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:05,717 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 97 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:05,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2024-10-24 01:27:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6596. [2024-10-24 01:27:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 1.6203184230477634) internal successors, (10686), 6595 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 10686 transitions. [2024-10-24 01:27:05,879 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 10686 transitions. Word has length 73 [2024-10-24 01:27:05,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:05,880 INFO L471 AbstractCegarLoop]: Abstraction has 6596 states and 10686 transitions. [2024-10-24 01:27:05,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 10686 transitions. [2024-10-24 01:27:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:27:05,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:05,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:05,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:27:05,881 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:05,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash -862982156, now seen corresponding path program 1 times [2024-10-24 01:27:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827263813] [2024-10-24 01:27:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827263813] [2024-10-24 01:27:05,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827263813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:05,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:05,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504987805] [2024-10-24 01:27:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:05,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:05,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:05,966 INFO L87 Difference]: Start difference. First operand 6596 states and 10686 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:06,125 INFO L93 Difference]: Finished difference Result 14795 states and 24192 transitions. [2024-10-24 01:27:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:06,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-24 01:27:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:06,174 INFO L225 Difference]: With dead ends: 14795 [2024-10-24 01:27:06,174 INFO L226 Difference]: Without dead ends: 9946 [2024-10-24 01:27:06,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:06,184 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 103 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:06,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 451 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2024-10-24 01:27:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9944. [2024-10-24 01:27:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9943 states have (on average 1.6145026651915921) internal successors, (16053), 9943 states have internal predecessors, (16053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 16053 transitions. [2024-10-24 01:27:06,504 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 16053 transitions. Word has length 73 [2024-10-24 01:27:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:06,505 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 16053 transitions. [2024-10-24 01:27:06,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 16053 transitions. [2024-10-24 01:27:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:27:06,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:06,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:06,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:27:06,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:06,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash -313891277, now seen corresponding path program 1 times [2024-10-24 01:27:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921547052] [2024-10-24 01:27:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:06,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921547052] [2024-10-24 01:27:06,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921547052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:06,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:06,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:06,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263680561] [2024-10-24 01:27:06,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:06,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:06,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:06,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:06,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:06,677 INFO L87 Difference]: Start difference. First operand 9944 states and 16053 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:06,914 INFO L93 Difference]: Finished difference Result 19814 states and 32005 transitions. [2024-10-24 01:27:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:06,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-24 01:27:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:06,937 INFO L225 Difference]: With dead ends: 19814 [2024-10-24 01:27:06,937 INFO L226 Difference]: Without dead ends: 9946 [2024-10-24 01:27:06,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:06,952 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 280 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:06,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 527 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2024-10-24 01:27:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9944. [2024-10-24 01:27:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9943 states have (on average 1.601931006738409) internal successors, (15928), 9943 states have internal predecessors, (15928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 15928 transitions. [2024-10-24 01:27:07,277 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 15928 transitions. Word has length 74 [2024-10-24 01:27:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:07,277 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 15928 transitions. [2024-10-24 01:27:07,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 15928 transitions. [2024-10-24 01:27:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:27:07,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:07,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:07,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:27:07,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1838096755, now seen corresponding path program 1 times [2024-10-24 01:27:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535334807] [2024-10-24 01:27:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535334807] [2024-10-24 01:27:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535334807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144296358] [2024-10-24 01:27:07,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:07,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:07,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:07,457 INFO L87 Difference]: Start difference. First operand 9944 states and 15928 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:07,840 INFO L93 Difference]: Finished difference Result 28494 states and 45791 transitions. [2024-10-24 01:27:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 01:27:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:07,889 INFO L225 Difference]: With dead ends: 28494 [2024-10-24 01:27:07,889 INFO L226 Difference]: Without dead ends: 18626 [2024-10-24 01:27:07,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:27:07,909 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 274 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:07,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 531 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18626 states. [2024-10-24 01:27:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18626 to 18624. [2024-10-24 01:27:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18624 states, 18623 states have (on average 1.5880899962412072) internal successors, (29575), 18623 states have internal predecessors, (29575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18624 states to 18624 states and 29575 transitions. [2024-10-24 01:27:08,518 INFO L78 Accepts]: Start accepts. Automaton has 18624 states and 29575 transitions. Word has length 77 [2024-10-24 01:27:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:08,518 INFO L471 AbstractCegarLoop]: Abstraction has 18624 states and 29575 transitions. [2024-10-24 01:27:08,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 18624 states and 29575 transitions. [2024-10-24 01:27:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:27:08,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:08,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:08,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:27:08,521 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1131905386, now seen corresponding path program 1 times [2024-10-24 01:27:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491225478] [2024-10-24 01:27:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491225478] [2024-10-24 01:27:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491225478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17003012] [2024-10-24 01:27:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:08,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:08,885 INFO L87 Difference]: Start difference. First operand 18624 states and 29575 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:09,071 INFO L93 Difference]: Finished difference Result 19350 states and 30662 transitions. [2024-10-24 01:27:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:27:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:09,114 INFO L225 Difference]: With dead ends: 19350 [2024-10-24 01:27:09,114 INFO L226 Difference]: Without dead ends: 19348 [2024-10-24 01:27:09,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:09,124 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:09,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19348 states. [2024-10-24 01:27:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19348 to 19348. [2024-10-24 01:27:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19348 states, 19347 states have (on average 1.5656174083837286) internal successors, (30290), 19347 states have internal predecessors, (30290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19348 states to 19348 states and 30290 transitions. [2024-10-24 01:27:09,590 INFO L78 Accepts]: Start accepts. Automaton has 19348 states and 30290 transitions. Word has length 78 [2024-10-24 01:27:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:09,591 INFO L471 AbstractCegarLoop]: Abstraction has 19348 states and 30290 transitions. [2024-10-24 01:27:09,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 19348 states and 30290 transitions. [2024-10-24 01:27:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 01:27:09,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:09,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:09,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:27:09,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:09,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash -89310492, now seen corresponding path program 1 times [2024-10-24 01:27:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:09,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279529944] [2024-10-24 01:27:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:27:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279529944] [2024-10-24 01:27:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279529944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:09,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:09,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256752773] [2024-10-24 01:27:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:09,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:09,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:09,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:09,744 INFO L87 Difference]: Start difference. First operand 19348 states and 30290 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:10,214 INFO L93 Difference]: Finished difference Result 47466 states and 74560 transitions. [2024-10-24 01:27:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-24 01:27:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:10,303 INFO L225 Difference]: With dead ends: 47466 [2024-10-24 01:27:10,304 INFO L226 Difference]: Without dead ends: 38254 [2024-10-24 01:27:10,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:27:10,334 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 448 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:10,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 807 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38254 states. [2024-10-24 01:27:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38254 to 29790. [2024-10-24 01:27:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29790 states, 29789 states have (on average 1.5638658565242203) internal successors, (46586), 29789 states have internal predecessors, (46586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29790 states to 29790 states and 46586 transitions. [2024-10-24 01:27:11,362 INFO L78 Accepts]: Start accepts. Automaton has 29790 states and 46586 transitions. Word has length 105 [2024-10-24 01:27:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:11,362 INFO L471 AbstractCegarLoop]: Abstraction has 29790 states and 46586 transitions. [2024-10-24 01:27:11,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 29790 states and 46586 transitions. [2024-10-24 01:27:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 01:27:11,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:11,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:11,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:27:11,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:11,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1367539108, now seen corresponding path program 1 times [2024-10-24 01:27:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:11,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400683117] [2024-10-24 01:27:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:27:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400683117] [2024-10-24 01:27:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400683117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:11,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573650714] [2024-10-24 01:27:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:11,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:11,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:11,514 INFO L87 Difference]: Start difference. First operand 29790 states and 46586 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:12,091 INFO L93 Difference]: Finished difference Result 51182 states and 80404 transitions. [2024-10-24 01:27:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:12,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-24 01:27:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:12,183 INFO L225 Difference]: With dead ends: 51182 [2024-10-24 01:27:12,184 INFO L226 Difference]: Without dead ends: 41970 [2024-10-24 01:27:12,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:27:12,209 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 441 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:12,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 929 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41970 states. [2024-10-24 01:27:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41970 to 40428. [2024-10-24 01:27:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.5644000296831326) internal successors, (63244), 40427 states have internal predecessors, (63244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 63244 transitions. [2024-10-24 01:27:13,290 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 63244 transitions. Word has length 105 [2024-10-24 01:27:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:13,291 INFO L471 AbstractCegarLoop]: Abstraction has 40428 states and 63244 transitions. [2024-10-24 01:27:13,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 63244 transitions. [2024-10-24 01:27:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 01:27:13,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:13,294 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:13,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:27:13,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1708412828, now seen corresponding path program 1 times [2024-10-24 01:27:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:13,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305711452] [2024-10-24 01:27:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:27:13,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305711452] [2024-10-24 01:27:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305711452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:27:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019952445] [2024-10-24 01:27:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:13,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:27:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:27:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:27:13,599 INFO L87 Difference]: Start difference. First operand 40428 states and 63244 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:14,159 INFO L93 Difference]: Finished difference Result 57492 states and 90488 transitions. [2024-10-24 01:27:14,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:27:14,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-24 01:27:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:14,245 INFO L225 Difference]: With dead ends: 57492 [2024-10-24 01:27:14,245 INFO L226 Difference]: Without dead ends: 48050 [2024-10-24 01:27:14,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:27:14,277 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 438 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:14,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 844 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48050 states. [2024-10-24 01:27:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48050 to 46508. [2024-10-24 01:27:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46508 states, 46507 states have (on average 1.5672479411701463) internal successors, (72888), 46507 states have internal predecessors, (72888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46508 states to 46508 states and 72888 transitions. [2024-10-24 01:27:15,653 INFO L78 Accepts]: Start accepts. Automaton has 46508 states and 72888 transitions. Word has length 105 [2024-10-24 01:27:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:15,654 INFO L471 AbstractCegarLoop]: Abstraction has 46508 states and 72888 transitions. [2024-10-24 01:27:15,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:15,654 INFO L276 IsEmpty]: Start isEmpty. Operand 46508 states and 72888 transitions. [2024-10-24 01:27:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 01:27:15,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:15,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:15,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:27:15,656 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:15,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1993407721, now seen corresponding path program 1 times [2024-10-24 01:27:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:15,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691860551] [2024-10-24 01:27:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:27:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691860551] [2024-10-24 01:27:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691860551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:15,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900961337] [2024-10-24 01:27:15,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:15,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:15,766 INFO L87 Difference]: Start difference. First operand 46508 states and 72888 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:16,545 INFO L93 Difference]: Finished difference Result 102904 states and 162083 transitions. [2024-10-24 01:27:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:16,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-24 01:27:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:16,698 INFO L225 Difference]: With dead ends: 102904 [2024-10-24 01:27:16,698 INFO L226 Difference]: Without dead ends: 75046 [2024-10-24 01:27:16,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:16,744 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:16,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 358 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75046 states. [2024-10-24 01:27:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75046 to 74841. [2024-10-24 01:27:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74841 states, 74840 states have (on average 1.5692009620523784) internal successors, (117439), 74840 states have internal predecessors, (117439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74841 states to 74841 states and 117439 transitions. [2024-10-24 01:27:18,581 INFO L78 Accepts]: Start accepts. Automaton has 74841 states and 117439 transitions. Word has length 106 [2024-10-24 01:27:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:18,582 INFO L471 AbstractCegarLoop]: Abstraction has 74841 states and 117439 transitions. [2024-10-24 01:27:18,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 74841 states and 117439 transitions. [2024-10-24 01:27:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 01:27:18,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:18,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:18,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:27:18,585 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:18,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1483911125, now seen corresponding path program 1 times [2024-10-24 01:27:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713031160] [2024-10-24 01:27:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:18,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:27:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713031160] [2024-10-24 01:27:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713031160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610879768] [2024-10-24 01:27:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:18,715 INFO L87 Difference]: Start difference. First operand 74841 states and 117439 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:19,899 INFO L93 Difference]: Finished difference Result 133622 states and 210608 transitions. [2024-10-24 01:27:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:19,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-24 01:27:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:20,076 INFO L225 Difference]: With dead ends: 133622 [2024-10-24 01:27:20,077 INFO L226 Difference]: Without dead ends: 102662 [2024-10-24 01:27:20,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:20,124 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 186 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:20,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 659 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:27:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102662 states. [2024-10-24 01:27:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102662 to 99529. [2024-10-24 01:27:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99529 states, 99528 states have (on average 1.5674985933606622) internal successors, (156010), 99528 states have internal predecessors, (156010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99529 states to 99529 states and 156010 transitions. [2024-10-24 01:27:22,528 INFO L78 Accepts]: Start accepts. Automaton has 99529 states and 156010 transitions. Word has length 106 [2024-10-24 01:27:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:22,529 INFO L471 AbstractCegarLoop]: Abstraction has 99529 states and 156010 transitions. [2024-10-24 01:27:22,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 99529 states and 156010 transitions. [2024-10-24 01:27:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:22,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:22,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:22,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:27:22,532 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:22,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2056530323, now seen corresponding path program 1 times [2024-10-24 01:27:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:22,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424024313] [2024-10-24 01:27:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:27:22,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424024313] [2024-10-24 01:27:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424024313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:22,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:22,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:27:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875211817] [2024-10-24 01:27:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:22,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:27:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:27:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:22,642 INFO L87 Difference]: Start difference. First operand 99529 states and 156010 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:24,077 INFO L93 Difference]: Finished difference Result 152570 states and 240067 transitions. [2024-10-24 01:27:24,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:27:24,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-24 01:27:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:24,300 INFO L225 Difference]: With dead ends: 152570 [2024-10-24 01:27:24,300 INFO L226 Difference]: Without dead ends: 123698 [2024-10-24 01:27:24,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:27:24,346 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 196 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:24,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 595 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123698 states. [2024-10-24 01:27:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123698 to 117566. [2024-10-24 01:27:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117566 states, 117565 states have (on average 1.566248458299664) internal successors, (184136), 117565 states have internal predecessors, (184136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117566 states to 117566 states and 184136 transitions. [2024-10-24 01:27:27,264 INFO L78 Accepts]: Start accepts. Automaton has 117566 states and 184136 transitions. Word has length 107 [2024-10-24 01:27:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:27,265 INFO L471 AbstractCegarLoop]: Abstraction has 117566 states and 184136 transitions. [2024-10-24 01:27:27,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 117566 states and 184136 transitions. [2024-10-24 01:27:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:27,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:27,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:27,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:27:27,267 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:27,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash 958573295, now seen corresponding path program 1 times [2024-10-24 01:27:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:27,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131039033] [2024-10-24 01:27:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:27:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131039033] [2024-10-24 01:27:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131039033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74633180] [2024-10-24 01:27:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:27,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:27,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:27,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:27,339 INFO L87 Difference]: Start difference. First operand 117566 states and 184136 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:29,420 INFO L93 Difference]: Finished difference Result 249504 states and 391595 transitions. [2024-10-24 01:27:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:29,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-24 01:27:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:29,789 INFO L225 Difference]: With dead ends: 249504 [2024-10-24 01:27:29,789 INFO L226 Difference]: Without dead ends: 193634 [2024-10-24 01:27:29,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:29,870 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:29,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 359 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193634 states. [2024-10-24 01:27:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193634 to 193104. [2024-10-24 01:27:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193104 states, 193103 states have (on average 1.5641289881565796) internal successors, (302038), 193103 states have internal predecessors, (302038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193104 states to 193104 states and 302038 transitions. [2024-10-24 01:27:33,913 INFO L78 Accepts]: Start accepts. Automaton has 193104 states and 302038 transitions. Word has length 107 [2024-10-24 01:27:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:33,914 INFO L471 AbstractCegarLoop]: Abstraction has 193104 states and 302038 transitions. [2024-10-24 01:27:33,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 193104 states and 302038 transitions. [2024-10-24 01:27:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:33,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:33,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:33,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:27:33,917 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:33,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -650969966, now seen corresponding path program 1 times [2024-10-24 01:27:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513907513] [2024-10-24 01:27:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:33,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513907513] [2024-10-24 01:27:33,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513907513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:33,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742018217] [2024-10-24 01:27:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:33,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:33,993 INFO L87 Difference]: Start difference. First operand 193104 states and 302038 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:27:38,643 INFO L93 Difference]: Finished difference Result 575102 states and 897746 transitions. [2024-10-24 01:27:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:27:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-24 01:27:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:27:39,437 INFO L225 Difference]: With dead ends: 575102 [2024-10-24 01:27:39,438 INFO L226 Difference]: Without dead ends: 382068 [2024-10-24 01:27:39,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:39,589 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 131 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:27:39,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 440 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:27:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382068 states. [2024-10-24 01:27:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382068 to 382066. [2024-10-24 01:27:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382066 states, 382065 states have (on average 1.5486370120267494) internal successors, (591680), 382065 states have internal predecessors, (591680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382066 states to 382066 states and 591680 transitions. [2024-10-24 01:27:48,081 INFO L78 Accepts]: Start accepts. Automaton has 382066 states and 591680 transitions. Word has length 107 [2024-10-24 01:27:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:27:48,081 INFO L471 AbstractCegarLoop]: Abstraction has 382066 states and 591680 transitions. [2024-10-24 01:27:48,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:27:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 382066 states and 591680 transitions. [2024-10-24 01:27:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 01:27:48,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:27:48,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:27:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:27:48,087 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:27:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:27:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1674275884, now seen corresponding path program 1 times [2024-10-24 01:27:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:27:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698232434] [2024-10-24 01:27:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:27:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:27:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:27:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:27:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:27:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698232434] [2024-10-24 01:27:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698232434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:27:48,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:27:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:27:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703754511] [2024-10-24 01:27:48,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:27:48,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:27:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:27:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:27:48,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:27:48,155 INFO L87 Difference]: Start difference. First operand 382066 states and 591680 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)