./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.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 84d02f5c6d16b666d2cee6c4cdde3d0f1860509873fce3916089bbbadc66a2c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:01:57,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:01:57,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:01:57,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:01:57,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:01:57,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:01:57,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:01:57,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:01:57,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:01:57,929 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:01:57,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:01:57,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:01:57,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:01:57,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:01:57,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:01:57,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:01:57,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:01:57,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:01:57,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:01:57,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:01:57,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:01:57,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:01:57,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:01:57,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:01:57,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:01:57,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:01:57,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:01:57,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:01:57,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:01:57,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:01:57,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:01:57,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:01:57,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:01:57,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:01:57,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:01:57,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:01:57,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:01:57,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:01:57,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:01:57,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:01:57,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:01:57,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:01:57,940 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 -> 84d02f5c6d16b666d2cee6c4cdde3d0f1860509873fce3916089bbbadc66a2c3 [2024-11-10 01:01:58,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:01:58,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:01:58,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:01:58,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:01:58,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:01:58,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:01:59,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:02:00,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:02:00,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:02:00,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7874cd06/1ea963c0fef9449aac0dc97793c10ff8/FLAG32c92435c [2024-11-10 01:02:00,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7874cd06/1ea963c0fef9449aac0dc97793c10ff8 [2024-11-10 01:02:00,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:02:00,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:02:00,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:02:00,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:02:00,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:02:00,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:00" (1/1) ... [2024-11-10 01:02:00,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8f644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:00, skipping insertion in model container [2024-11-10 01:02:00,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:00" (1/1) ... [2024-11-10 01:02:00,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:02:01,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[20454,20467] [2024-11-10 01:02:01,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[28202,28215] [2024-11-10 01:02:01,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:02:01,750 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:02:01,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[20454,20467] [2024-11-10 01:02:01,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[28202,28215] [2024-11-10 01:02:02,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:02:02,163 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:02:02,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02 WrapperNode [2024-11-10 01:02:02,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:02:02,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:02:02,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:02:02,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:02:02,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,513 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5217 [2024-11-10 01:02:02,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:02:02,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:02:02,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:02:02,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:02:02,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:02:02,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:02:02,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:02:02,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:02:02,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:02:02,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (1/1) ... [2024-11-10 01:02:02,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:02:02,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:02:03,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:02:03,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:02:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:02:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:02:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:02:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:02:03,160 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:02:03,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:02:07,833 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret47#1; [2024-11-10 01:02:07,834 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret45#1; [2024-11-10 01:02:07,834 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret46#1; [2024-11-10 01:02:08,060 INFO L? ?]: Removed 2091 outVars from TransFormulas that were not future-live. [2024-11-10 01:02:08,060 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:02:08,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:02:08,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:02:08,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:02:08 BoogieIcfgContainer [2024-11-10 01:02:08,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:02:08,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:02:08,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:02:08,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:02:08,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:02:00" (1/3) ... [2024-11-10 01:02:08,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfe238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:02:08, skipping insertion in model container [2024-11-10 01:02:08,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:02" (2/3) ... [2024-11-10 01:02:08,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfe238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:02:08, skipping insertion in model container [2024-11-10 01:02:08,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:02:08" (3/3) ... [2024-11-10 01:02:08,103 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 01:02:08,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:02:08,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:02:08,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:02:08,210 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;@2012cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:02:08,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:02:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 939 states, 936 states have (on average 2.622863247863248) internal successors, (2455), 938 states have internal predecessors, (2455), 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-11-10 01:02:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:02:08,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:08,228 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] [2024-11-10 01:02:08,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:08,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1060095836, now seen corresponding path program 1 times [2024-11-10 01:02:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877298304] [2024-11-10 01:02:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:08,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877298304] [2024-11-10 01:02:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877298304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:08,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:02:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711262689] [2024-11-10 01:02:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:02:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:08,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:02:08,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:02:08,547 INFO L87 Difference]: Start difference. First operand has 939 states, 936 states have (on average 2.622863247863248) internal successors, (2455), 938 states have internal predecessors, (2455), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-10 01:02:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:08,613 INFO L93 Difference]: Finished difference Result 1818 states and 4798 transitions. [2024-11-10 01:02:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:02:08,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2024-11-10 01:02:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:08,630 INFO L225 Difference]: With dead ends: 1818 [2024-11-10 01:02:08,631 INFO L226 Difference]: Without dead ends: 871 [2024-11-10 01:02:08,638 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-11-10 01:02:08,641 INFO L432 NwaCegarLoop]: 2384 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:08,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-10 01:02:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2024-11-10 01:02:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 2.669735327963176) internal successors, (2320), 870 states have internal predecessors, (2320), 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-11-10 01:02:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2320 transitions. [2024-11-10 01:02:08,716 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2320 transitions. Word has length 30 [2024-11-10 01:02:08,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:08,717 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 2320 transitions. [2024-11-10 01:02:08,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-10 01:02:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2320 transitions. [2024-11-10 01:02:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:02:08,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:08,719 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] [2024-11-10 01:02:08,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:02:08,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1127102589, now seen corresponding path program 1 times [2024-11-10 01:02:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141342007] [2024-11-10 01:02:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:08,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:09,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:09,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141342007] [2024-11-10 01:02:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141342007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:09,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:09,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:02:09,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150051357] [2024-11-10 01:02:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:09,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:02:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:09,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:02:09,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:02:09,137 INFO L87 Difference]: Start difference. First operand 871 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-11-10 01:02:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:09,274 INFO L93 Difference]: Finished difference Result 934 states and 2417 transitions. [2024-11-10 01:02:09,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:02:09,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2024-11-10 01:02:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:09,281 INFO L225 Difference]: With dead ends: 934 [2024-11-10 01:02:09,281 INFO L226 Difference]: Without dead ends: 871 [2024-11-10 01:02:09,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:02:09,283 INFO L432 NwaCegarLoop]: 2318 mSDtfsCounter, 0 mSDsluCounter, 6899 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9217 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:09,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9217 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-10 01:02:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2024-11-10 01:02:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 2.6121979286536248) internal successors, (2270), 870 states have internal predecessors, (2270), 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-11-10 01:02:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2270 transitions. [2024-11-10 01:02:09,316 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2270 transitions. Word has length 30 [2024-11-10 01:02:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:09,317 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 2270 transitions. [2024-11-10 01:02:09,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-11-10 01:02:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2270 transitions. [2024-11-10 01:02:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 01:02:09,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:09,321 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-11-10 01:02:09,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:02:09,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:09,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash -739010594, now seen corresponding path program 1 times [2024-11-10 01:02:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169136887] [2024-11-10 01:02:09,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:09,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:09,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169136887] [2024-11-10 01:02:09,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169136887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:09,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611480829] [2024-11-10 01:02:09,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:09,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:02:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:02:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:02:09,537 INFO L87 Difference]: Start difference. First operand 871 states and 2270 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-11-10 01:02:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:17,077 INFO L93 Difference]: Finished difference Result 3130 states and 8623 transitions. [2024-11-10 01:02:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:02:17,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-11-10 01:02:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:17,093 INFO L225 Difference]: With dead ends: 3130 [2024-11-10 01:02:17,093 INFO L226 Difference]: Without dead ends: 2375 [2024-11-10 01:02:17,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:02:17,098 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 4525 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:17,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 867 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-10 01:02:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2024-11-10 01:02:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2375. [2024-11-10 01:02:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2373 states have (on average 2.363253265908133) internal successors, (5608), 2374 states have internal predecessors, (5608), 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-11-10 01:02:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 5608 transitions. [2024-11-10 01:02:17,161 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 5608 transitions. Word has length 69 [2024-11-10 01:02:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:17,162 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 5608 transitions. [2024-11-10 01:02:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-11-10 01:02:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 5608 transitions. [2024-11-10 01:02:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 01:02:17,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:17,166 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, 1] [2024-11-10 01:02:17,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:02:17,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:17,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:17,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1437015884, now seen corresponding path program 1 times [2024-11-10 01:02:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:17,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898003094] [2024-11-10 01:02:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898003094] [2024-11-10 01:02:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898003094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:17,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273726231] [2024-11-10 01:02:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:17,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:17,453 INFO L87 Difference]: Start difference. First operand 2375 states and 5608 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-11-10 01:02:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:17,827 INFO L93 Difference]: Finished difference Result 3201 states and 6910 transitions. [2024-11-10 01:02:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 01:02:17,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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 79 [2024-11-10 01:02:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:17,838 INFO L225 Difference]: With dead ends: 3201 [2024-11-10 01:02:17,838 INFO L226 Difference]: Without dead ends: 3142 [2024-11-10 01:02:17,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-10 01:02:17,840 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 16434 mSDsluCounter, 2692 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16434 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:17,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16434 Valid, 4956 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:02:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-11-10 01:02:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 2431. [2024-11-10 01:02:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2429 states have (on average 2.3454096335940715) internal successors, (5697), 2430 states have internal predecessors, (5697), 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-11-10 01:02:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 5697 transitions. [2024-11-10 01:02:17,878 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 5697 transitions. Word has length 79 [2024-11-10 01:02:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:17,879 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 5697 transitions. [2024-11-10 01:02:17,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-11-10 01:02:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 5697 transitions. [2024-11-10 01:02:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 01:02:17,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:17,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:02:17,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:02:17,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:17,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash 282155758, now seen corresponding path program 1 times [2024-11-10 01:02:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224874514] [2024-11-10 01:02:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:18,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224874514] [2024-11-10 01:02:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224874514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:18,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:18,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145984941] [2024-11-10 01:02:18,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:18,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:18,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:18,281 INFO L87 Difference]: Start difference. First operand 2431 states and 5697 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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-11-10 01:02:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:18,560 INFO L93 Difference]: Finished difference Result 2549 states and 5881 transitions. [2024-11-10 01:02:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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 81 [2024-11-10 01:02:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:18,569 INFO L225 Difference]: With dead ends: 2549 [2024-11-10 01:02:18,569 INFO L226 Difference]: Without dead ends: 2434 [2024-11-10 01:02:18,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-10 01:02:18,571 INFO L432 NwaCegarLoop]: 2261 mSDtfsCounter, 15362 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15362 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:18,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15362 Valid, 2801 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2024-11-10 01:02:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2431. [2024-11-10 01:02:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2429 states have (on average 2.344997941539728) internal successors, (5696), 2430 states have internal predecessors, (5696), 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-11-10 01:02:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 5696 transitions. [2024-11-10 01:02:18,610 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 5696 transitions. Word has length 81 [2024-11-10 01:02:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 5696 transitions. [2024-11-10 01:02:18,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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-11-10 01:02:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 5696 transitions. [2024-11-10 01:02:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 01:02:18,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:18,612 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, 1, 1, 1, 1] [2024-11-10 01:02:18,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:02:18,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1880713111, now seen corresponding path program 1 times [2024-11-10 01:02:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616530456] [2024-11-10 01:02:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:18,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616530456] [2024-11-10 01:02:18,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616530456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:18,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199902063] [2024-11-10 01:02:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:18,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:18,695 INFO L87 Difference]: Start difference. First operand 2431 states and 5696 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-11-10 01:02:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:18,746 INFO L93 Difference]: Finished difference Result 2649 states and 6038 transitions. [2024-11-10 01:02:18,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:18,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2024-11-10 01:02:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:18,757 INFO L225 Difference]: With dead ends: 2649 [2024-11-10 01:02:18,757 INFO L226 Difference]: Without dead ends: 2534 [2024-11-10 01:02:18,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:18,761 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 2184 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 2352 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-11-10 01:02:18,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 2352 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-11-10 01:02:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2529. [2024-11-10 01:02:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2527 states have (on average 2.3142065690542144) internal successors, (5848), 2528 states have internal predecessors, (5848), 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-11-10 01:02:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 5848 transitions. [2024-11-10 01:02:18,808 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 5848 transitions. Word has length 82 [2024-11-10 01:02:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:18,809 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 5848 transitions. [2024-11-10 01:02:18,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-11-10 01:02:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 5848 transitions. [2024-11-10 01:02:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:18,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:18,812 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, 1, 1, 1, 1, 1] [2024-11-10 01:02:18,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:02:18,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:18,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:18,812 INFO L85 PathProgramCache]: Analyzing trace with hash -613981456, now seen corresponding path program 1 times [2024-11-10 01:02:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:18,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750066887] [2024-11-10 01:02:18,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750066887] [2024-11-10 01:02:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750066887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563452506] [2024-11-10 01:02:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:18,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:18,879 INFO L87 Difference]: Start difference. First operand 2529 states and 5848 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:18,921 INFO L93 Difference]: Finished difference Result 2939 states and 6486 transitions. [2024-11-10 01:02:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:18,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 01:02:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:18,930 INFO L225 Difference]: With dead ends: 2939 [2024-11-10 01:02:18,931 INFO L226 Difference]: Without dead ends: 2726 [2024-11-10 01:02:18,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:18,935 INFO L432 NwaCegarLoop]: 2339 mSDtfsCounter, 2201 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:18,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 2437 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2024-11-10 01:02:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2723. [2024-11-10 01:02:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2721 states have (on average 2.25909592061742) internal successors, (6147), 2722 states have internal predecessors, (6147), 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-11-10 01:02:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 6147 transitions. [2024-11-10 01:02:18,982 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 6147 transitions. Word has length 83 [2024-11-10 01:02:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:18,983 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 6147 transitions. [2024-11-10 01:02:18,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 6147 transitions. [2024-11-10 01:02:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:18,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:18,986 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, 1, 1, 1, 1, 1] [2024-11-10 01:02:18,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:02:18,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:18,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1386522256, now seen corresponding path program 1 times [2024-11-10 01:02:18,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060718948] [2024-11-10 01:02:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060718948] [2024-11-10 01:02:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060718948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:19,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:19,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015162371] [2024-11-10 01:02:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:19,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:19,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:19,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,050 INFO L87 Difference]: Start difference. First operand 2723 states and 6147 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:19,086 INFO L93 Difference]: Finished difference Result 3505 states and 7355 transitions. [2024-11-10 01:02:19,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:19,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 01:02:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:19,099 INFO L225 Difference]: With dead ends: 3505 [2024-11-10 01:02:19,099 INFO L226 Difference]: Without dead ends: 3098 [2024-11-10 01:02:19,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,105 INFO L432 NwaCegarLoop]: 2327 mSDtfsCounter, 2197 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:19,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 2433 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2024-11-10 01:02:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3095. [2024-11-10 01:02:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 3093 states have (on average 2.170384739734885) internal successors, (6713), 3094 states have internal predecessors, (6713), 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-11-10 01:02:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 6713 transitions. [2024-11-10 01:02:19,171 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 6713 transitions. Word has length 83 [2024-11-10 01:02:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:19,172 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 6713 transitions. [2024-11-10 01:02:19,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 6713 transitions. [2024-11-10 01:02:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:19,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:19,173 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, 1, 1, 1, 1, 1] [2024-11-10 01:02:19,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:02:19,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:19,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1907035312, now seen corresponding path program 1 times [2024-11-10 01:02:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328022234] [2024-11-10 01:02:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328022234] [2024-11-10 01:02:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328022234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:19,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071760182] [2024-11-10 01:02:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:19,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:19,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,236 INFO L87 Difference]: Start difference. First operand 3095 states and 6713 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:19,281 INFO L93 Difference]: Finished difference Result 4589 states and 8997 transitions. [2024-11-10 01:02:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:19,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 01:02:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:19,296 INFO L225 Difference]: With dead ends: 4589 [2024-11-10 01:02:19,297 INFO L226 Difference]: Without dead ends: 3810 [2024-11-10 01:02:19,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,301 INFO L432 NwaCegarLoop]: 2325 mSDtfsCounter, 2195 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:19,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 2435 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2024-11-10 01:02:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3807. [2024-11-10 01:02:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3805 states have (on average 2.044940867279895) internal successors, (7781), 3806 states have internal predecessors, (7781), 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-11-10 01:02:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 7781 transitions. [2024-11-10 01:02:19,369 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 7781 transitions. Word has length 83 [2024-11-10 01:02:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:19,369 INFO L471 AbstractCegarLoop]: Abstraction has 3807 states and 7781 transitions. [2024-11-10 01:02:19,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 7781 transitions. [2024-11-10 01:02:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:19,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:19,370 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, 1, 1, 1, 1, 1] [2024-11-10 01:02:19,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:02:19,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:19,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1892585456, now seen corresponding path program 1 times [2024-11-10 01:02:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467059638] [2024-11-10 01:02:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467059638] [2024-11-10 01:02:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467059638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:19,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771988891] [2024-11-10 01:02:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,439 INFO L87 Difference]: Start difference. First operand 3807 states and 7781 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:19,514 INFO L93 Difference]: Finished difference Result 6661 states and 12089 transitions. [2024-11-10 01:02:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:19,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 01:02:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:19,522 INFO L225 Difference]: With dead ends: 6661 [2024-11-10 01:02:19,522 INFO L226 Difference]: Without dead ends: 5170 [2024-11-10 01:02:19,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,525 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 2193 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:19,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 2437 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5170 states. [2024-11-10 01:02:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5170 to 5167. [2024-11-10 01:02:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5167 states, 5165 states have (on average 1.8952565343659245) internal successors, (9789), 5166 states have internal predecessors, (9789), 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-11-10 01:02:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 9789 transitions. [2024-11-10 01:02:19,680 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 9789 transitions. Word has length 83 [2024-11-10 01:02:19,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:19,680 INFO L471 AbstractCegarLoop]: Abstraction has 5167 states and 9789 transitions. [2024-11-10 01:02:19,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 9789 transitions. [2024-11-10 01:02:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:19,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:19,681 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, 1, 1, 1, 1, 1] [2024-11-10 01:02:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:02:19,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -310779088, now seen corresponding path program 1 times [2024-11-10 01:02:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:19,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152159070] [2024-11-10 01:02:19,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152159070] [2024-11-10 01:02:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152159070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:19,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374557978] [2024-11-10 01:02:19,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:19,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:19,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:19,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,739 INFO L87 Difference]: Start difference. First operand 5167 states and 9789 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:19,826 INFO L93 Difference]: Finished difference Result 10613 states and 17889 transitions. [2024-11-10 01:02:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:19,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 01:02:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:19,840 INFO L225 Difference]: With dead ends: 10613 [2024-11-10 01:02:19,840 INFO L226 Difference]: Without dead ends: 7762 [2024-11-10 01:02:19,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:19,845 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 2191 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:19,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2439 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2024-11-10 01:02:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 7759. [2024-11-10 01:02:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7759 states, 7757 states have (on average 1.7466804176872501) internal successors, (13549), 7758 states have internal predecessors, (13549), 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-11-10 01:02:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 13549 transitions. [2024-11-10 01:02:20,006 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 13549 transitions. Word has length 83 [2024-11-10 01:02:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:20,007 INFO L471 AbstractCegarLoop]: Abstraction has 7759 states and 13549 transitions. [2024-11-10 01:02:20,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 13549 transitions. [2024-11-10 01:02:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:20,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:20,009 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, 1, 1, 1, 1, 1] [2024-11-10 01:02:20,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:02:20,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash -835056143, now seen corresponding path program 1 times [2024-11-10 01:02:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762069896] [2024-11-10 01:02:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:20,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762069896] [2024-11-10 01:02:20,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762069896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:20,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:20,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:02:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807335197] [2024-11-10 01:02:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:20,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:02:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:02:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:02:20,221 INFO L87 Difference]: Start difference. First operand 7759 states and 13549 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-11-10 01:02:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:20,334 INFO L93 Difference]: Finished difference Result 7954 states and 13807 transitions. [2024-11-10 01:02:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:02:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2024-11-10 01:02:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:20,346 INFO L225 Difference]: With dead ends: 7954 [2024-11-10 01:02:20,346 INFO L226 Difference]: Without dead ends: 7951 [2024-11-10 01:02:20,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:02:20,349 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 0 mSDsluCounter, 13571 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15835 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:20,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15835 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7951 states. [2024-11-10 01:02:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7951 to 7951. [2024-11-10 01:02:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7951 states, 7949 states have (on average 1.724619448987294) internal successors, (13709), 7950 states have internal predecessors, (13709), 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-11-10 01:02:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7951 states to 7951 states and 13709 transitions. [2024-11-10 01:02:20,496 INFO L78 Accepts]: Start accepts. Automaton has 7951 states and 13709 transitions. Word has length 83 [2024-11-10 01:02:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:20,496 INFO L471 AbstractCegarLoop]: Abstraction has 7951 states and 13709 transitions. [2024-11-10 01:02:20,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-11-10 01:02:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7951 states and 13709 transitions. [2024-11-10 01:02:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:02:20,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:02:20,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:02:20,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1104447952, now seen corresponding path program 1 times [2024-11-10 01:02:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837874788] [2024-11-10 01:02:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:20,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837874788] [2024-11-10 01:02:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837874788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623797490] [2024-11-10 01:02:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:20,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:20,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:20,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:20,611 INFO L87 Difference]: Start difference. First operand 7951 states and 13709 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:20,823 INFO L93 Difference]: Finished difference Result 18709 states and 29201 transitions. [2024-11-10 01:02:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:20,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 01:02:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:20,848 INFO L225 Difference]: With dead ends: 18709 [2024-11-10 01:02:20,848 INFO L226 Difference]: Without dead ends: 13074 [2024-11-10 01:02:20,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:20,860 INFO L432 NwaCegarLoop]: 2337 mSDtfsCounter, 2199 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:20,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 2439 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13074 states. [2024-11-10 01:02:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13074 to 13071. [2024-11-10 01:02:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13071 states, 13069 states have (on average 1.5974443339199633) internal successors, (20877), 13070 states have internal predecessors, (20877), 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-11-10 01:02:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13071 states to 13071 states and 20877 transitions. [2024-11-10 01:02:21,213 INFO L78 Accepts]: Start accepts. Automaton has 13071 states and 20877 transitions. Word has length 83 [2024-11-10 01:02:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:21,213 INFO L471 AbstractCegarLoop]: Abstraction has 13071 states and 20877 transitions. [2024-11-10 01:02:21,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 01:02:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 13071 states and 20877 transitions. [2024-11-10 01:02:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 01:02:21,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:21,215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:02:21,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:02:21,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:21,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 410277008, now seen corresponding path program 1 times [2024-11-10 01:02:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:21,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346578588] [2024-11-10 01:02:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:02:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:21,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346578588] [2024-11-10 01:02:21,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346578588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:21,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:21,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:02:21,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375334476] [2024-11-10 01:02:21,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:21,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:02:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:21,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:02:21,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:21,278 INFO L87 Difference]: Start difference. First operand 13071 states and 20877 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-11-10 01:02:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:21,578 INFO L93 Difference]: Finished difference Result 24345 states and 37142 transitions. [2024-11-10 01:02:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:02:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2024-11-10 01:02:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:21,613 INFO L225 Difference]: With dead ends: 24345 [2024-11-10 01:02:21,614 INFO L226 Difference]: Without dead ends: 18325 [2024-11-10 01:02:21,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:02:21,629 INFO L432 NwaCegarLoop]: 2344 mSDtfsCounter, 2200 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:21,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:02:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2024-11-10 01:02:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 18322. [2024-11-10 01:02:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18322 states, 18320 states have (on average 1.5414847161572052) internal successors, (28240), 18321 states have internal predecessors, (28240), 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-11-10 01:02:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18322 states to 18322 states and 28240 transitions. [2024-11-10 01:02:22,107 INFO L78 Accepts]: Start accepts. Automaton has 18322 states and 28240 transitions. Word has length 85 [2024-11-10 01:02:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:22,107 INFO L471 AbstractCegarLoop]: Abstraction has 18322 states and 28240 transitions. [2024-11-10 01:02:22,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-11-10 01:02:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 18322 states and 28240 transitions. [2024-11-10 01:02:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:22,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:22,111 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, 1] [2024-11-10 01:02:22,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:02:22,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:22,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1965372354, now seen corresponding path program 1 times [2024-11-10 01:02:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177310438] [2024-11-10 01:02:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:02:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:22,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177310438] [2024-11-10 01:02:22,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177310438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:22,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:22,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:22,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433891197] [2024-11-10 01:02:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:22,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:22,312 INFO L87 Difference]: Start difference. First operand 18322 states and 28240 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-11-10 01:02:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:23,817 INFO L93 Difference]: Finished difference Result 133674 states and 191840 transitions. [2024-11-10 01:02:23,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:23,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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 108 [2024-11-10 01:02:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:24,181 INFO L225 Difference]: With dead ends: 133674 [2024-11-10 01:02:24,185 INFO L226 Difference]: Without dead ends: 117671 [2024-11-10 01:02:24,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:02:24,244 INFO L432 NwaCegarLoop]: 2366 mSDtfsCounter, 14021 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14021 SdHoareTripleChecker+Valid, 5799 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:24,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14021 Valid, 5799 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117671 states. [2024-11-10 01:02:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117671 to 34322. [2024-11-10 01:02:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34322 states, 34320 states have (on average 1.4792540792540791) internal successors, (50768), 34321 states have internal predecessors, (50768), 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-11-10 01:02:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34322 states to 34322 states and 50768 transitions. [2024-11-10 01:02:25,733 INFO L78 Accepts]: Start accepts. Automaton has 34322 states and 50768 transitions. Word has length 108 [2024-11-10 01:02:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:25,733 INFO L471 AbstractCegarLoop]: Abstraction has 34322 states and 50768 transitions. [2024-11-10 01:02:25,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-11-10 01:02:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34322 states and 50768 transitions. [2024-11-10 01:02:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:25,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:25,739 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, 1] [2024-11-10 01:02:25,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:02:25,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1557054142, now seen corresponding path program 1 times [2024-11-10 01:02:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128632424] [2024-11-10 01:02:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 01:02:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128632424] [2024-11-10 01:02:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128632424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:26,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:26,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300613994] [2024-11-10 01:02:26,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:26,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:26,165 INFO L87 Difference]: Start difference. First operand 34322 states and 50768 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 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-11-10 01:02:28,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:28,385 INFO L93 Difference]: Finished difference Result 149674 states and 214368 transitions. [2024-11-10 01:02:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:28,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 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 108 [2024-11-10 01:02:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:28,799 INFO L225 Difference]: With dead ends: 149674 [2024-11-10 01:02:28,799 INFO L226 Difference]: Without dead ends: 133671 [2024-11-10 01:02:28,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:02:28,852 INFO L432 NwaCegarLoop]: 2362 mSDtfsCounter, 14073 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14073 SdHoareTripleChecker+Valid, 5740 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:28,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14073 Valid, 5740 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133671 states. [2024-11-10 01:02:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133671 to 58386. [2024-11-10 01:02:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58386 states, 58384 states have (on average 1.4461496300356262) internal successors, (84432), 58385 states have internal predecessors, (84432), 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-11-10 01:02:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58386 states to 58386 states and 84432 transitions. [2024-11-10 01:02:31,172 INFO L78 Accepts]: Start accepts. Automaton has 58386 states and 84432 transitions. Word has length 108 [2024-11-10 01:02:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:31,172 INFO L471 AbstractCegarLoop]: Abstraction has 58386 states and 84432 transitions. [2024-11-10 01:02:31,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 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-11-10 01:02:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 58386 states and 84432 transitions. [2024-11-10 01:02:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:31,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:31,178 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, 1] [2024-11-10 01:02:31,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:02:31,178 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:31,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash 555644414, now seen corresponding path program 1 times [2024-11-10 01:02:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982970616] [2024-11-10 01:02:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:02:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982970616] [2024-11-10 01:02:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982970616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394915357] [2024-11-10 01:02:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:31,343 INFO L87 Difference]: Start difference. First operand 58386 states and 84432 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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-11-10 01:02:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:34,343 INFO L93 Difference]: Finished difference Result 165674 states and 236896 transitions. [2024-11-10 01:02:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:34,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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 108 [2024-11-10 01:02:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:34,583 INFO L225 Difference]: With dead ends: 165674 [2024-11-10 01:02:34,584 INFO L226 Difference]: Without dead ends: 149671 [2024-11-10 01:02:34,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:02:34,629 INFO L432 NwaCegarLoop]: 2358 mSDtfsCounter, 14133 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14133 SdHoareTripleChecker+Valid, 5649 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:34,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14133 Valid, 5649 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149671 states. [2024-11-10 01:02:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149671 to 74386. [2024-11-10 01:02:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74386 states, 74384 states have (on average 1.4379436437943645) internal successors, (106960), 74385 states have internal predecessors, (106960), 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-11-10 01:02:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74386 states to 74386 states and 106960 transitions. [2024-11-10 01:02:37,270 INFO L78 Accepts]: Start accepts. Automaton has 74386 states and 106960 transitions. Word has length 108 [2024-11-10 01:02:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:37,271 INFO L471 AbstractCegarLoop]: Abstraction has 74386 states and 106960 transitions. [2024-11-10 01:02:37,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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-11-10 01:02:37,271 INFO L276 IsEmpty]: Start isEmpty. Operand 74386 states and 106960 transitions. [2024-11-10 01:02:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:37,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:37,282 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, 1] [2024-11-10 01:02:37,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:02:37,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 541194558, now seen corresponding path program 1 times [2024-11-10 01:02:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:37,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579910095] [2024-11-10 01:02:37,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 01:02:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579910095] [2024-11-10 01:02:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579910095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:37,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:37,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:37,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406621694] [2024-11-10 01:02:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:37,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:37,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:37,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:37,697 INFO L87 Difference]: Start difference. First operand 74386 states and 106960 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-11-10 01:02:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:41,173 INFO L93 Difference]: Finished difference Result 181674 states and 259424 transitions. [2024-11-10 01:02:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 108 [2024-11-10 01:02:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:41,538 INFO L225 Difference]: With dead ends: 181674 [2024-11-10 01:02:41,538 INFO L226 Difference]: Without dead ends: 165671 [2024-11-10 01:02:41,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:02:41,560 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 14199 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14199 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:41,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14199 Valid, 5634 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165671 states. [2024-11-10 01:02:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165671 to 90386. [2024-11-10 01:02:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90386 states, 90384 states have (on average 1.432642945654098) internal successors, (129488), 90385 states have internal predecessors, (129488), 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-11-10 01:02:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90386 states to 90386 states and 129488 transitions. [2024-11-10 01:02:44,465 INFO L78 Accepts]: Start accepts. Automaton has 90386 states and 129488 transitions. Word has length 108 [2024-11-10 01:02:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:44,465 INFO L471 AbstractCegarLoop]: Abstraction has 90386 states and 129488 transitions. [2024-11-10 01:02:44,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-11-10 01:02:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 90386 states and 129488 transitions. [2024-11-10 01:02:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:44,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:44,479 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, 1] [2024-11-10 01:02:44,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:02:44,480 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:44,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1662169986, now seen corresponding path program 1 times [2024-11-10 01:02:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:44,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104173838] [2024-11-10 01:02:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 01:02:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104173838] [2024-11-10 01:02:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104173838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:44,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916924262] [2024-11-10 01:02:44,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:44,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:44,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:44,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:44,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:44,685 INFO L87 Difference]: Start difference. First operand 90386 states and 129488 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-11-10 01:02:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:02:48,589 INFO L93 Difference]: Finished difference Result 197674 states and 281952 transitions. [2024-11-10 01:02:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:02:48,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 108 [2024-11-10 01:02:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:02:48,905 INFO L225 Difference]: With dead ends: 197674 [2024-11-10 01:02:48,905 INFO L226 Difference]: Without dead ends: 181671 [2024-11-10 01:02:48,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:02:48,966 INFO L432 NwaCegarLoop]: 2363 mSDtfsCounter, 14034 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14034 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:02:48,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14034 Valid, 5793 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:02:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181671 states. [2024-11-10 01:02:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181671 to 106386. [2024-11-10 01:02:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106386 states, 106384 states have (on average 1.4289366822078509) internal successors, (152016), 106385 states have internal predecessors, (152016), 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-11-10 01:02:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106386 states to 106386 states and 152016 transitions. [2024-11-10 01:02:52,595 INFO L78 Accepts]: Start accepts. Automaton has 106386 states and 152016 transitions. Word has length 108 [2024-11-10 01:02:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:02:52,595 INFO L471 AbstractCegarLoop]: Abstraction has 106386 states and 152016 transitions. [2024-11-10 01:02:52,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-11-10 01:02:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 106386 states and 152016 transitions. [2024-11-10 01:02:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:02:52,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:02:52,601 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, 1] [2024-11-10 01:02:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:02:52,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:02:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:02:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1839128446, now seen corresponding path program 1 times [2024-11-10 01:02:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:02:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281334491] [2024-11-10 01:02:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:02:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:02:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:02:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 01:02:52,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:02:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281334491] [2024-11-10 01:02:52,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281334491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:02:52,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:02:52,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:02:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512571958] [2024-11-10 01:02:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:02:52,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:02:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:02:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:02:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:02:52,782 INFO L87 Difference]: Start difference. First operand 106386 states and 152016 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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)