./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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 3fea2f68f947d5e58136ef35d3f027c4c03d3bc0c134cd3fe1f5c31a7ea21160 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:05:20,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:05:20,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:05:20,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:05:20,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:05:20,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:05:20,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:05:20,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:05:20,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:05:20,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:05:20,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:05:20,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:05:20,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:05:20,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:05:20,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:05:20,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:05:20,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:05:20,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:05:20,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:05:20,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:05:20,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:05:20,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:05:20,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:05:20,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:05:20,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:05:20,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:05:20,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:05:20,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:05:20,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:05:20,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:05:20,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:05:20,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:05:20,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:05:20,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:05:20,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:05:20,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:05:20,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:05:20,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:05:20,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:05:20,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:05:20,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:05:20,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:05:20,330 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 -> 3fea2f68f947d5e58136ef35d3f027c4c03d3bc0c134cd3fe1f5c31a7ea21160 [2024-11-10 01:05:20,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:05:20,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:05:20,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:05:20,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:05:20,611 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:05:20,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 01:05:22,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:05:22,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:05:22,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 01:05:22,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6601bb808/1505a7d585cc4aeda47c9cc11ed88520/FLAG36424d004 [2024-11-10 01:05:22,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6601bb808/1505a7d585cc4aeda47c9cc11ed88520 [2024-11-10 01:05:22,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:05:22,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:05:22,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:05:22,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:05:22,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:05:22,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:05:22" (1/1) ... [2024-11-10 01:05:22,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c633847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:22, skipping insertion in model container [2024-11-10 01:05:22,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:05:22" (1/1) ... [2024-11-10 01:05:22,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:05:23,169 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[26962,26975] [2024-11-10 01:05:23,231 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[33898,33911] [2024-11-10 01:05:23,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:05:23,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:05:23,922 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[26962,26975] [2024-11-10 01:05:23,940 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[33898,33911] [2024-11-10 01:05:24,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:05:24,358 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:05:24,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24 WrapperNode [2024-11-10 01:05:24,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:05:24,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:05:24,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:05:24,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:05:24,366 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:05:24" (1/1) ... [2024-11-10 01:05:24,426 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:05:24" (1/1) ... [2024-11-10 01:05:24,716 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5287 [2024-11-10 01:05:24,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:05:24,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:05:24,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:05:24,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:05:24,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:24,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:24,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:24,986 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:05:24,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:24,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:25,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:25,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:25,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:25,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:25,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:05:25,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:05:25,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:05:25,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:05:25,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (1/1) ... [2024-11-10 01:05:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:05:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:05:25,273 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:05:25,276 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:05:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:05:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:05:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:05:25,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:05:25,465 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:05:25,467 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:05:30,814 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc calculate_output_#t~ret49#1; [2024-11-10 01:05:30,815 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3853: havoc calculate_output2_#t~ret50#1; [2024-11-10 01:05:30,815 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5343: havoc calculate_output3_#t~ret51#1; [2024-11-10 01:05:31,066 INFO L? ?]: Removed 2096 outVars from TransFormulas that were not future-live. [2024-11-10 01:05:31,066 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:05:31,108 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:05:31,108 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:05:31,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:05:31 BoogieIcfgContainer [2024-11-10 01:05:31,109 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:05:31,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:05:31,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:05:31,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:05:31,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:05:22" (1/3) ... [2024-11-10 01:05:31,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40546a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:05:31, skipping insertion in model container [2024-11-10 01:05:31,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:05:24" (2/3) ... [2024-11-10 01:05:31,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40546a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:05:31, skipping insertion in model container [2024-11-10 01:05:31,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:05:31" (3/3) ... [2024-11-10 01:05:31,119 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 01:05:31,133 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:05:31,134 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:05:31,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:05:31,276 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;@458c6bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:05:31,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:05:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 954 states, 951 states have (on average 2.6119873817034702) internal successors, (2484), 953 states have internal predecessors, (2484), 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:05:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:05:31,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:31,296 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] [2024-11-10 01:05:31,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:31,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1923967236, now seen corresponding path program 1 times [2024-11-10 01:05:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:31,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138827985] [2024-11-10 01:05:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:31,709 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:05:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:31,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138827985] [2024-11-10 01:05:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138827985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:31,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:05:31,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753039061] [2024-11-10 01:05:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:31,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:05:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:05:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:05:31,748 INFO L87 Difference]: Start difference. First operand has 954 states, 951 states have (on average 2.6119873817034702) internal successors, (2484), 953 states have internal predecessors, (2484), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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:05:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:31,854 INFO L93 Difference]: Finished difference Result 1837 states and 4834 transitions. [2024-11-10 01:05:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:05:31,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2024-11-10 01:05:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:31,884 INFO L225 Difference]: With dead ends: 1837 [2024-11-10 01:05:31,884 INFO L226 Difference]: Without dead ends: 886 [2024-11-10 01:05:31,894 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:05:31,899 INFO L432 NwaCegarLoop]: 2413 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, 2413 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:05:31,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-10 01:05:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-10 01:05:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 2.6572398190045248) internal successors, (2349), 885 states have internal predecessors, (2349), 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:05:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2349 transitions. [2024-11-10 01:05:32,023 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2349 transitions. Word has length 32 [2024-11-10 01:05:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:32,024 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 2349 transitions. [2024-11-10 01:05:32,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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:05:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2349 transitions. [2024-11-10 01:05:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:05:32,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:32,029 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] [2024-11-10 01:05:32,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:05:32,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1892947429, now seen corresponding path program 1 times [2024-11-10 01:05:32,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:32,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182388715] [2024-11-10 01:05:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:32,352 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:05:32,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:32,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182388715] [2024-11-10 01:05:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182388715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:05:32,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909103076] [2024-11-10 01:05:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:32,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:05:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:05:32,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:05:32,359 INFO L87 Difference]: Start difference. First operand 886 states and 2349 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:05:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:32,529 INFO L93 Difference]: Finished difference Result 953 states and 2453 transitions. [2024-11-10 01:05:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:05:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-11-10 01:05:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:32,536 INFO L225 Difference]: With dead ends: 953 [2024-11-10 01:05:32,536 INFO L226 Difference]: Without dead ends: 886 [2024-11-10 01:05:32,537 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:05:32,539 INFO L432 NwaCegarLoop]: 2347 mSDtfsCounter, 0 mSDsluCounter, 6975 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9322 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:32,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9322 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:05:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-10 01:05:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-10 01:05:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 2.588235294117647) internal successors, (2288), 885 states have internal predecessors, (2288), 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:05:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2288 transitions. [2024-11-10 01:05:32,571 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2288 transitions. Word has length 32 [2024-11-10 01:05:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:32,571 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 2288 transitions. [2024-11-10 01:05:32,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:05:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2288 transitions. [2024-11-10 01:05:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 01:05:32,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:32,574 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] [2024-11-10 01:05:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:05:32,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1443051623, now seen corresponding path program 1 times [2024-11-10 01:05:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038124622] [2024-11-10 01:05:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:32,842 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:05:32,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038124622] [2024-11-10 01:05:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038124622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:32,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:32,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811711247] [2024-11-10 01:05:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:32,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:05:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:05:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:05:32,846 INFO L87 Difference]: Start difference. First operand 886 states and 2288 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:05:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:40,927 INFO L93 Difference]: Finished difference Result 3145 states and 8641 transitions. [2024-11-10 01:05:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:05:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-11-10 01:05:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:40,943 INFO L225 Difference]: With dead ends: 3145 [2024-11-10 01:05:40,943 INFO L226 Difference]: Without dead ends: 2390 [2024-11-10 01:05:40,945 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:05:40,947 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 4557 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8238 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4557 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 8238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:40,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4557 Valid, 885 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 8238 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-10 01:05:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-11-10 01:05:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2024-11-10 01:05:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2388 states have (on average 2.4187604690117253) internal successors, (5776), 2389 states have internal predecessors, (5776), 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:05:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 5776 transitions. [2024-11-10 01:05:41,022 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 5776 transitions. Word has length 62 [2024-11-10 01:05:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 5776 transitions. [2024-11-10 01:05:41,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:05:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 5776 transitions. [2024-11-10 01:05:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 01:05:41,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:41,028 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:41,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:05:41,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash -713735649, now seen corresponding path program 1 times [2024-11-10 01:05:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569961989] [2024-11-10 01:05:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:41,429 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:05:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569961989] [2024-11-10 01:05:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569961989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:41,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:41,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261145125] [2024-11-10 01:05:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:41,433 INFO L87 Difference]: Start difference. First operand 2390 states and 5776 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:41,966 INFO L93 Difference]: Finished difference Result 3398 states and 7376 transitions. [2024-11-10 01:05:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 01:05:41,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-10 01:05:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:41,984 INFO L225 Difference]: With dead ends: 3398 [2024-11-10 01:05:41,985 INFO L226 Difference]: Without dead ends: 3335 [2024-11-10 01:05:41,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 01:05:41,990 INFO L432 NwaCegarLoop]: 2284 mSDtfsCounter, 18877 mSDsluCounter, 5120 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18877 SdHoareTripleChecker+Valid, 7404 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:41,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18877 Valid, 7404 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2024-11-10 01:05:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2450. [2024-11-10 01:05:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 2.3986928104575163) internal successors, (5872), 2449 states have internal predecessors, (5872), 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:05:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 5872 transitions. [2024-11-10 01:05:42,058 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 5872 transitions. Word has length 92 [2024-11-10 01:05:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:42,059 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 5872 transitions. [2024-11-10 01:05:42,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:05:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 5872 transitions. [2024-11-10 01:05:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 01:05:42,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:42,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:42,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:05:42,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:42,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -710798079, now seen corresponding path program 1 times [2024-11-10 01:05:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107553592] [2024-11-10 01:05:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:42,625 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:05:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107553592] [2024-11-10 01:05:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107553592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:42,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:42,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423596957] [2024-11-10 01:05:42,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:42,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:42,631 INFO L87 Difference]: Start difference. First operand 2450 states and 5872 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:05:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:43,106 INFO L93 Difference]: Finished difference Result 2576 states and 6070 transitions. [2024-11-10 01:05:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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 94 [2024-11-10 01:05:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:43,120 INFO L225 Difference]: With dead ends: 2576 [2024-11-10 01:05:43,120 INFO L226 Difference]: Without dead ends: 2453 [2024-11-10 01:05:43,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 01:05:43,124 INFO L432 NwaCegarLoop]: 2278 mSDtfsCounter, 8844 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8844 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:43,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8844 Valid, 2969 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:05:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2024-11-10 01:05:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2450. [2024-11-10 01:05:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 2.3982843137254903) internal successors, (5871), 2449 states have internal predecessors, (5871), 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:05:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 5871 transitions. [2024-11-10 01:05:43,185 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 5871 transitions. Word has length 94 [2024-11-10 01:05:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:43,185 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 5871 transitions. [2024-11-10 01:05:43,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:05:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 5871 transitions. [2024-11-10 01:05:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 01:05:43,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:43,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:43,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:05:43,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:43,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1163915236, now seen corresponding path program 1 times [2024-11-10 01:05:43,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316739975] [2024-11-10 01:05:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:43,328 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:05:43,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316739975] [2024-11-10 01:05:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316739975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:43,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:43,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134312994] [2024-11-10 01:05:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:43,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:43,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:43,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:43,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:43,331 INFO L87 Difference]: Start difference. First operand 2450 states and 5871 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:05:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:43,371 INFO L93 Difference]: Finished difference Result 2684 states and 6241 transitions. [2024-11-10 01:05:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-10 01:05:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:43,382 INFO L225 Difference]: With dead ends: 2684 [2024-11-10 01:05:43,383 INFO L226 Difference]: Without dead ends: 2561 [2024-11-10 01:05:43,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:43,385 INFO L432 NwaCegarLoop]: 2294 mSDtfsCounter, 2190 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:43,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2389 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2024-11-10 01:05:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2558. [2024-11-10 01:05:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 2.3634585289514867) internal successors, (6041), 2557 states have internal predecessors, (6041), 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:05:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 6041 transitions. [2024-11-10 01:05:43,443 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 6041 transitions. Word has length 95 [2024-11-10 01:05:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:43,444 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 6041 transitions. [2024-11-10 01:05:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:05:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 6041 transitions. [2024-11-10 01:05:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:43,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:43,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:43,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:05:43,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:43,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2094869955, now seen corresponding path program 1 times [2024-11-10 01:05:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31659591] [2024-11-10 01:05:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:43,543 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:05:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31659591] [2024-11-10 01:05:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31659591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815649588] [2024-11-10 01:05:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:43,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:43,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:43,546 INFO L87 Difference]: Start difference. First operand 2558 states and 6041 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:43,586 INFO L93 Difference]: Finished difference Result 2799 states and 6421 transitions. [2024-11-10 01:05:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:43,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:43,598 INFO L225 Difference]: With dead ends: 2799 [2024-11-10 01:05:43,598 INFO L226 Difference]: Without dead ends: 2676 [2024-11-10 01:05:43,599 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:05:43,600 INFO L432 NwaCegarLoop]: 2372 mSDtfsCounter, 2210 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2473 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:05:43,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2473 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-10 01:05:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2673. [2024-11-10 01:05:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2671 states have (on average 2.329090228378884) internal successors, (6221), 2672 states have internal predecessors, (6221), 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:05:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 6221 transitions. [2024-11-10 01:05:43,659 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 6221 transitions. Word has length 96 [2024-11-10 01:05:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:43,659 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 6221 transitions. [2024-11-10 01:05:43,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 6221 transitions. [2024-11-10 01:05:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:43,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:43,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:43,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:05:43,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:43,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1826988291, now seen corresponding path program 1 times [2024-11-10 01:05:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127394130] [2024-11-10 01:05:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:43,818 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:05:43,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127394130] [2024-11-10 01:05:43,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127394130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:43,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:43,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770642044] [2024-11-10 01:05:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:43,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:43,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:43,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:43,821 INFO L87 Difference]: Start difference. First operand 2673 states and 6221 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:43,874 INFO L93 Difference]: Finished difference Result 3335 states and 7263 transitions. [2024-11-10 01:05:43,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:43,887 INFO L225 Difference]: With dead ends: 3335 [2024-11-10 01:05:43,888 INFO L226 Difference]: Without dead ends: 2992 [2024-11-10 01:05:43,890 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:05:43,891 INFO L432 NwaCegarLoop]: 2374 mSDtfsCounter, 2208 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 2479 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:05:43,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 2479 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2024-11-10 01:05:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2989. [2024-11-10 01:05:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 2.2474054235018412) internal successors, (6713), 2988 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:05:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 6713 transitions. [2024-11-10 01:05:43,981 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 6713 transitions. Word has length 96 [2024-11-10 01:05:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:43,981 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 6713 transitions. [2024-11-10 01:05:43,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 6713 transitions. [2024-11-10 01:05:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:43,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:43,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:05:43,984 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:43,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1359879101, now seen corresponding path program 1 times [2024-11-10 01:05:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371126484] [2024-11-10 01:05:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:44,090 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:05:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:44,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371126484] [2024-11-10 01:05:44,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371126484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:44,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:44,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042419275] [2024-11-10 01:05:44,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:44,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:44,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:44,094 INFO L87 Difference]: Start difference. First operand 2989 states and 6713 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:44,164 INFO L93 Difference]: Finished difference Result 4259 states and 8697 transitions. [2024-11-10 01:05:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:44,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:44,184 INFO L225 Difference]: With dead ends: 4259 [2024-11-10 01:05:44,185 INFO L226 Difference]: Without dead ends: 3600 [2024-11-10 01:05:44,188 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:05:44,189 INFO L432 NwaCegarLoop]: 2372 mSDtfsCounter, 2206 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 2481 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:05:44,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2206 Valid, 2481 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2024-11-10 01:05:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3597. [2024-11-10 01:05:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3595 states have (on average 2.1276773296244786) internal successors, (7649), 3596 states have internal predecessors, (7649), 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:05:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 7649 transitions. [2024-11-10 01:05:44,319 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 7649 transitions. Word has length 96 [2024-11-10 01:05:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:44,320 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 7649 transitions. [2024-11-10 01:05:44,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 7649 transitions. [2024-11-10 01:05:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:44,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, 1, 1, 1, 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:05:44,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:05:44,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:44,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:44,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2132419901, now seen corresponding path program 1 times [2024-11-10 01:05:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710452844] [2024-11-10 01:05:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:44,434 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:05:44,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:44,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710452844] [2024-11-10 01:05:44,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710452844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:44,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374670641] [2024-11-10 01:05:44,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:44,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:44,438 INFO L87 Difference]: Start difference. First operand 3597 states and 7649 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:44,533 INFO L93 Difference]: Finished difference Result 6035 states and 11421 transitions. [2024-11-10 01:05:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:44,555 INFO L225 Difference]: With dead ends: 6035 [2024-11-10 01:05:44,556 INFO L226 Difference]: Without dead ends: 4768 [2024-11-10 01:05:44,560 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:05:44,561 INFO L432 NwaCegarLoop]: 2360 mSDtfsCounter, 2202 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 2477 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:05:44,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 2477 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2024-11-10 01:05:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4765. [2024-11-10 01:05:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4765 states, 4763 states have (on average 1.978794877178249) internal successors, (9425), 4764 states have internal predecessors, (9425), 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:05:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 9425 transitions. [2024-11-10 01:05:44,714 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 9425 transitions. Word has length 96 [2024-11-10 01:05:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:44,715 INFO L471 AbstractCegarLoop]: Abstraction has 4765 states and 9425 transitions. [2024-11-10 01:05:44,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 9425 transitions. [2024-11-10 01:05:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:44,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:44,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:44,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:05:44,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:44,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1161137667, now seen corresponding path program 1 times [2024-11-10 01:05:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:44,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720764604] [2024-11-10 01:05:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:44,830 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:05:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720764604] [2024-11-10 01:05:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720764604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:44,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:44,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523263406] [2024-11-10 01:05:44,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:44,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:44,833 INFO L87 Difference]: Start difference. First operand 4765 states and 9425 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:44,943 INFO L93 Difference]: Finished difference Result 9443 states and 16581 transitions. [2024-11-10 01:05:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:44,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:44,960 INFO L225 Difference]: With dead ends: 9443 [2024-11-10 01:05:44,960 INFO L226 Difference]: Without dead ends: 7008 [2024-11-10 01:05:44,966 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:05:44,967 INFO L432 NwaCegarLoop]: 2358 mSDtfsCounter, 2200 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2479 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:05:44,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2479 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2024-11-10 01:05:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 7005. [2024-11-10 01:05:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 7003 states have (on average 1.8256461516492932) internal successors, (12785), 7004 states have internal predecessors, (12785), 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:05:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 12785 transitions. [2024-11-10 01:05:45,162 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 12785 transitions. Word has length 96 [2024-11-10 01:05:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:45,162 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 12785 transitions. [2024-11-10 01:05:45,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 12785 transitions. [2024-11-10 01:05:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:45,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:45,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:45,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:05:45,164 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:45,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1146687811, now seen corresponding path program 1 times [2024-11-10 01:05:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372022635] [2024-11-10 01:05:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:45,257 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:05:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372022635] [2024-11-10 01:05:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372022635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951251309] [2024-11-10 01:05:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:45,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:45,259 INFO L87 Difference]: Start difference. First operand 7005 states and 12785 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:45,534 INFO L93 Difference]: Finished difference Result 15971 states and 26325 transitions. [2024-11-10 01:05:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:45,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:45,559 INFO L225 Difference]: With dead ends: 15971 [2024-11-10 01:05:45,559 INFO L226 Difference]: Without dead ends: 11296 [2024-11-10 01:05:45,569 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:05:45,569 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 2198 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 2481 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:05:45,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 2481 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-11-10 01:05:45,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 11293. [2024-11-10 01:05:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11293 states, 11291 states have (on average 1.6934726773536446) internal successors, (19121), 11292 states have internal predecessors, (19121), 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:05:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11293 states to 11293 states and 19121 transitions. [2024-11-10 01:05:45,874 INFO L78 Accepts]: Start accepts. Automaton has 11293 states and 19121 transitions. Word has length 96 [2024-11-10 01:05:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 11293 states and 19121 transitions. [2024-11-10 01:05:45,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 11293 states and 19121 transitions. [2024-11-10 01:05:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:45,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:45,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:05:45,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1056676733, now seen corresponding path program 1 times [2024-11-10 01:05:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870752972] [2024-11-10 01:05:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:45,969 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:05:45,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870752972] [2024-11-10 01:05:45,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870752972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:45,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:45,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068884929] [2024-11-10 01:05:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:45,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:45,972 INFO L87 Difference]: Start difference. First operand 11293 states and 19121 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:46,271 INFO L93 Difference]: Finished difference Result 28451 states and 44661 transitions. [2024-11-10 01:05:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:46,314 INFO L225 Difference]: With dead ends: 28451 [2024-11-10 01:05:46,315 INFO L226 Difference]: Without dead ends: 19488 [2024-11-10 01:05:46,332 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:05:46,333 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 2196 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 2483 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:05:46,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 2483 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19488 states. [2024-11-10 01:05:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19488 to 19485. [2024-11-10 01:05:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19485 states, 19483 states have (on average 1.5924138992968229) internal successors, (31025), 19484 states have internal predecessors, (31025), 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:05:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 31025 transitions. [2024-11-10 01:05:47,044 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 31025 transitions. Word has length 96 [2024-11-10 01:05:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:47,044 INFO L471 AbstractCegarLoop]: Abstraction has 19485 states and 31025 transitions. [2024-11-10 01:05:47,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 31025 transitions. [2024-11-10 01:05:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:47,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:47,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:47,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:05:47,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:47,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1580953788, now seen corresponding path program 1 times [2024-11-10 01:05:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:47,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418931469] [2024-11-10 01:05:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:47,400 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:05:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:47,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418931469] [2024-11-10 01:05:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418931469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:47,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:05:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928730973] [2024-11-10 01:05:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:47,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:05:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:47,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:05:47,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:05:47,403 INFO L87 Difference]: Start difference. First operand 19485 states and 31025 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 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:05:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:47,725 INFO L93 Difference]: Finished difference Result 20256 states and 32051 transitions. [2024-11-10 01:05:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:05:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 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 96 [2024-11-10 01:05:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:47,769 INFO L225 Difference]: With dead ends: 20256 [2024-11-10 01:05:47,769 INFO L226 Difference]: Without dead ends: 20253 [2024-11-10 01:05:47,779 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:05:47,780 INFO L432 NwaCegarLoop]: 2282 mSDtfsCounter, 0 mSDsluCounter, 13679 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15961 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:05:47,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15961 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20253 states. [2024-11-10 01:05:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20253 to 20253. [2024-11-10 01:05:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20253 states, 20251 states have (on average 1.5667868253419583) internal successors, (31729), 20252 states have internal predecessors, (31729), 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:05:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20253 states to 20253 states and 31729 transitions. [2024-11-10 01:05:48,481 INFO L78 Accepts]: Start accepts. Automaton has 20253 states and 31729 transitions. Word has length 96 [2024-11-10 01:05:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:48,481 INFO L471 AbstractCegarLoop]: Abstraction has 20253 states and 31729 transitions. [2024-11-10 01:05:48,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 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:05:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 20253 states and 31729 transitions. [2024-11-10 01:05:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:05:48,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:48,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:48,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:05:48,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:48,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1850345597, now seen corresponding path program 1 times [2024-11-10 01:05:48,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:48,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514865551] [2024-11-10 01:05:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:48,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:48,579 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:05:48,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514865551] [2024-11-10 01:05:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514865551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:05:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721209397] [2024-11-10 01:05:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:48,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:05:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:05:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:05:48,581 INFO L87 Difference]: Start difference. First operand 20253 states and 31729 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:49,353 INFO L93 Difference]: Finished difference Result 54563 states and 81141 transitions. [2024-11-10 01:05:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:05:49,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 96 [2024-11-10 01:05:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:49,431 INFO L225 Difference]: With dead ends: 54563 [2024-11-10 01:05:49,432 INFO L226 Difference]: Without dead ends: 36640 [2024-11-10 01:05:49,460 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:05:49,461 INFO L432 NwaCegarLoop]: 2370 mSDtfsCounter, 2204 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 2483 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:05:49,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 2483 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:05:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36640 states. [2024-11-10 01:05:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36640 to 36637. [2024-11-10 01:05:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36637 states, 36635 states have (on average 1.4932441654155861) internal successors, (54705), 36636 states have internal predecessors, (54705), 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:05:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 54705 transitions. [2024-11-10 01:05:50,882 INFO L78 Accepts]: Start accepts. Automaton has 36637 states and 54705 transitions. Word has length 96 [2024-11-10 01:05:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:50,883 INFO L471 AbstractCegarLoop]: Abstraction has 36637 states and 54705 transitions. [2024-11-10 01:05:50,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:05:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 36637 states and 54705 transitions. [2024-11-10 01:05:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:50,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:50,893 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:50,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:05:50,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:50,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -684209181, now seen corresponding path program 1 times [2024-11-10 01:05:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448362685] [2024-11-10 01:05:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 01:05:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448362685] [2024-11-10 01:05:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448362685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285311393] [2024-11-10 01:05:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:51,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:51,225 INFO L87 Difference]: Start difference. First operand 36637 states and 54705 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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:05:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:05:55,784 INFO L93 Difference]: Finished difference Result 307896 states and 442051 transitions. [2024-11-10 01:05:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:05:55,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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 123 [2024-11-10 01:05:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:56,445 INFO L225 Difference]: With dead ends: 307896 [2024-11-10 01:05:56,445 INFO L226 Difference]: Without dead ends: 283829 [2024-11-10 01:05:56,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:05:56,540 INFO L432 NwaCegarLoop]: 2392 mSDtfsCounter, 16522 mSDsluCounter, 4413 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16522 SdHoareTripleChecker+Valid, 6805 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:56,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16522 Valid, 6805 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283829 states. [2024-11-10 01:06:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283829 to 65949. [2024-11-10 01:06:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65949 states, 65947 states have (on average 1.4583984108450725) internal successors, (96177), 65948 states have internal predecessors, (96177), 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:06:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65949 states to 65949 states and 96177 transitions. [2024-11-10 01:06:00,422 INFO L78 Accepts]: Start accepts. Automaton has 65949 states and 96177 transitions. Word has length 123 [2024-11-10 01:06:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:06:00,422 INFO L471 AbstractCegarLoop]: Abstraction has 65949 states and 96177 transitions. [2024-11-10 01:06:00,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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:06:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 65949 states and 96177 transitions. [2024-11-10 01:06:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:06:00,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:06:00,439 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:06:00,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:06:00,439 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:06:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:06:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -952090845, now seen corresponding path program 1 times [2024-11-10 01:06:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:06:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332181632] [2024-11-10 01:06:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:06:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:06:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:06:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:06:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:06:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332181632] [2024-11-10 01:06:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332181632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:06:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:06:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:06:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027727975] [2024-11-10 01:06:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:06:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:06:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:06:00,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:06:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:06:00,943 INFO L87 Difference]: Start difference. First operand 65949 states and 96177 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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:06:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:06:06,522 INFO L93 Difference]: Finished difference Result 342200 states and 490819 transitions. [2024-11-10 01:06:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:06:06,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 123 [2024-11-10 01:06:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:06:07,097 INFO L225 Difference]: With dead ends: 342200 [2024-11-10 01:06:07,097 INFO L226 Difference]: Without dead ends: 307893 [2024-11-10 01:06:07,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:06:07,175 INFO L432 NwaCegarLoop]: 2393 mSDtfsCounter, 16526 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16526 SdHoareTripleChecker+Valid, 6701 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:06:07,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16526 Valid, 6701 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:06:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307893 states. [2024-11-10 01:06:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307893 to 112285. [2024-11-10 01:06:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112285 states, 112283 states have (on average 1.440226926605096) internal successors, (161713), 112284 states have internal predecessors, (161713), 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:06:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112285 states to 112285 states and 161713 transitions. [2024-11-10 01:06:12,148 INFO L78 Accepts]: Start accepts. Automaton has 112285 states and 161713 transitions. Word has length 123 [2024-11-10 01:06:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:06:12,149 INFO L471 AbstractCegarLoop]: Abstraction has 112285 states and 161713 transitions. [2024-11-10 01:06:12,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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:06:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 112285 states and 161713 transitions. [2024-11-10 01:06:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:06:12,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:06:12,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:06:12,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:06:12,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:06:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:06:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash 156009059, now seen corresponding path program 1 times [2024-11-10 01:06:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:06:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684743695] [2024-11-10 01:06:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:06:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:06:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:06:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 01:06:12,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:06:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684743695] [2024-11-10 01:06:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684743695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:06:12,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:06:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:06:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818623479] [2024-11-10 01:06:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:06:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:06:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:06:12,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:06:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:06:12,435 INFO L87 Difference]: Start difference. First operand 112285 states and 161713 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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:06:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:06:19,751 INFO L93 Difference]: Finished difference Result 376504 states and 539459 transitions. [2024-11-10 01:06:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:06:19,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 123 [2024-11-10 01:06:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:06:20,311 INFO L225 Difference]: With dead ends: 376504 [2024-11-10 01:06:20,312 INFO L226 Difference]: Without dead ends: 342197 [2024-11-10 01:06:20,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:06:20,416 INFO L432 NwaCegarLoop]: 2390 mSDtfsCounter, 16568 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16568 SdHoareTripleChecker+Valid, 6644 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:06:20,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16568 Valid, 6644 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:06:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342197 states. [2024-11-10 01:06:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342197 to 146589. [2024-11-10 01:06:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146589 states, 146587 states have (on average 1.43500446833621) internal successors, (210353), 146588 states have internal predecessors, (210353), 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:06:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146589 states to 146589 states and 210353 transitions. [2024-11-10 01:06:26,334 INFO L78 Accepts]: Start accepts. Automaton has 146589 states and 210353 transitions. Word has length 123 [2024-11-10 01:06:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:06:26,335 INFO L471 AbstractCegarLoop]: Abstraction has 146589 states and 210353 transitions. [2024-11-10 01:06:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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:06:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 146589 states and 210353 transitions. [2024-11-10 01:06:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:06:26,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:06:26,348 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:06:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:06:26,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:06:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:06:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -616531741, now seen corresponding path program 1 times [2024-11-10 01:06:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:06:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665417193] [2024-11-10 01:06:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:06:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:06:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:06:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:06:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:06:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665417193] [2024-11-10 01:06:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665417193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:06:26,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:06:26,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:06:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644692146] [2024-11-10 01:06:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:06:26,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:06:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:06:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:06:26,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:06:26,615 INFO L87 Difference]: Start difference. First operand 146589 states and 210353 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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)