./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'a36bffe61006645fe9b7956abb35417c0319419001c91f9dd38ab2cdcd2c159e'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a36bffe61006645fe9b7956abb35417c0319419001c91f9dd38ab2cdcd2c159e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:39:51,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:39:51,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:39:51,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:39:51,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:39:51,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:39:51,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:39:51,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:39:51,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:39:51,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:39:51,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:39:51,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:39:51,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:39:51,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:39:51,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:39:51,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:39:51,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:39:51,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:39:51,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:39:51,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> a36bffe61006645fe9b7956abb35417c0319419001c91f9dd38ab2cdcd2c159e [2024-11-07 01:39:52,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:39:52,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:39:52,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:39:52,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:39:52,174 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:39:52,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-07 01:39:53,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:39:53,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:39:53,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-07 01:39:53,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4382697e9/9b3a422bc1754d0b99d28e8aa2c516c0/FLAG6d8326f64 [2024-11-07 01:39:53,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4382697e9/9b3a422bc1754d0b99d28e8aa2c516c0 [2024-11-07 01:39:53,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:39:53,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:39:53,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:39:53,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:39:53,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:39:53,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:39:53" (1/1) ... [2024-11-07 01:39:53,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ee77f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:53, skipping insertion in model container [2024-11-07 01:39:53,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:39:53" (1/1) ... [2024-11-07 01:39:54,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:39:54,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[26925,26938] [2024-11-07 01:39:54,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[33861,33874] [2024-11-07 01:39:55,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:39:55,084 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:39:55,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[26925,26938] [2024-11-07 01:39:55,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[33861,33874] [2024-11-07 01:39:55,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:39:55,398 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:39:55,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55 WrapperNode [2024-11-07 01:39:55,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:39:55,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:39:55,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:39:55,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:39:55,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:55,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:55,841 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5292 [2024-11-07 01:39:55,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:39:55,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:39:55,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:39:55,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:39:55,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:55,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:55,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,086 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-07 01:39:56,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:39:56,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:39:56,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:39:56,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:39:56,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (1/1) ... [2024-11-07 01:39:56,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:39:56,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:39:56,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:39:56,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:39:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:39:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:39:56,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:39:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:39:56,823 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:39:56,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:40:00,284 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-07 01:40:00,285 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:40:00,308 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:40:00,308 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 01:40:00,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:40:00 BoogieIcfgContainer [2024-11-07 01:40:00,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:40:00,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:40:00,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:40:00,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:40:00,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:39:53" (1/3) ... [2024-11-07 01:40:00,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cc1705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:40:00, skipping insertion in model container [2024-11-07 01:40:00,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:39:55" (2/3) ... [2024-11-07 01:40:00,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cc1705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:40:00, skipping insertion in model container [2024-11-07 01:40:00,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:40:00" (3/3) ... [2024-11-07 01:40:00,318 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-07 01:40:00,329 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:40:00,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:40:00,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:40:00,396 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;@3994c95c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:40:00,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:40:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 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-07 01:40:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 01:40:00,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:00,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:40:00,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1967767115, now seen corresponding path program 1 times [2024-11-07 01:40:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:00,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086228625] [2024-11-07 01:40:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:00,643 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-07 01:40:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086228625] [2024-11-07 01:40:00,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086228625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:00,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:40:00,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004651882] [2024-11-07 01:40:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:00,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 01:40:00,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 01:40:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:40:00,693 INFO L87 Difference]: Start difference. First operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:40:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:00,753 INFO L93 Difference]: Finished difference Result 1829 states and 3468 transitions. [2024-11-07 01:40:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 01:40:00,754 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-07 01:40:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:00,763 INFO L225 Difference]: With dead ends: 1829 [2024-11-07 01:40:00,763 INFO L226 Difference]: Without dead ends: 883 [2024-11-07 01:40:00,766 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-07 01:40:00,768 INFO L432 NwaCegarLoop]: 1731 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, 1731 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-07 01:40:00,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-07 01:40:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-07 01:40:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 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-07 01:40:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2024-11-07 01:40:00,844 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2024-11-07 01:40:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:00,847 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2024-11-07 01:40:00,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:40:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2024-11-07 01:40:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 01:40:00,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:00,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:40:00,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:40:00,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:00,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2101780621, now seen corresponding path program 1 times [2024-11-07 01:40:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106590728] [2024-11-07 01:40:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:01,138 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-07 01:40:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:01,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106590728] [2024-11-07 01:40:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106590728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:01,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:40:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577663341] [2024-11-07 01:40:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:01,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:40:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:40:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:40:01,140 INFO L87 Difference]: Start difference. First operand 883 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:40:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:01,228 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2024-11-07 01:40:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:40:01,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-07 01:40:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:01,231 INFO L225 Difference]: With dead ends: 949 [2024-11-07 01:40:01,231 INFO L226 Difference]: Without dead ends: 883 [2024-11-07 01:40:01,232 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-07 01:40:01,233 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 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-07 01:40:01,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:40:01,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-07 01:40:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-07 01:40:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 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-07 01:40:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2024-11-07 01:40:01,249 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2024-11-07 01:40:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:01,249 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2024-11-07 01:40:01,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:40:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2024-11-07 01:40:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:40:01,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:01,250 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] [2024-11-07 01:40:01,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:40:01,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:01,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1501646299, now seen corresponding path program 1 times [2024-11-07 01:40:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:01,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440566097] [2024-11-07 01:40:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:01,463 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-07 01:40:01,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:01,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440566097] [2024-11-07 01:40:01,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440566097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:01,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:01,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21661872] [2024-11-07 01:40:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:01,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:40:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:01,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:40:01,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:40:01,466 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-07 01:40:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:06,878 INFO L93 Difference]: Finished difference Result 3138 states and 5915 transitions. [2024-11-07 01:40:06,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:40:06,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-07 01:40:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:06,887 INFO L225 Difference]: With dead ends: 3138 [2024-11-07 01:40:06,887 INFO L226 Difference]: Without dead ends: 2385 [2024-11-07 01:40:06,888 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-07 01:40:06,888 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 2527 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:40:06,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 860 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-07 01:40:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-11-07 01:40:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2024-11-07 01:40:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2383 states have (on average 1.56105749055812) internal successors, (3720), 2384 states have internal predecessors, (3720), 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-07 01:40:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3720 transitions. [2024-11-07 01:40:06,947 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3720 transitions. Word has length 60 [2024-11-07 01:40:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:06,948 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3720 transitions. [2024-11-07 01:40:06,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-07 01:40:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3720 transitions. [2024-11-07 01:40:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 01:40:06,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:06,952 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] [2024-11-07 01:40:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:40:06,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:06,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1651582301, now seen corresponding path program 1 times [2024-11-07 01:40:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507964894] [2024-11-07 01:40:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:07,358 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-07 01:40:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:07,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507964894] [2024-11-07 01:40:07,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507964894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:07,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:07,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:40:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899527557] [2024-11-07 01:40:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:07,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:40:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:07,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:40:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:40:07,361 INFO L87 Difference]: Start difference. First operand 2385 states and 3720 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-07 01:40:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:07,817 INFO L93 Difference]: Finished difference Result 3377 states and 5320 transitions. [2024-11-07 01:40:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:40:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 90 [2024-11-07 01:40:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:07,830 INFO L225 Difference]: With dead ends: 3377 [2024-11-07 01:40:07,830 INFO L226 Difference]: Without dead ends: 3315 [2024-11-07 01:40:07,832 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-07 01:40:07,833 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 13578 mSDsluCounter, 3975 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13578 SdHoareTripleChecker+Valid, 5575 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:40:07,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13578 Valid, 5575 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:40:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2024-11-07 01:40:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2445. [2024-11-07 01:40:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2443 states have (on average 1.5624232501023332) internal successors, (3817), 2444 states have internal predecessors, (3817), 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-07 01:40:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3817 transitions. [2024-11-07 01:40:07,899 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3817 transitions. Word has length 90 [2024-11-07 01:40:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:07,900 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3817 transitions. [2024-11-07 01:40:07,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-07 01:40:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3817 transitions. [2024-11-07 01:40:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 01:40:07,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:07,904 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-07 01:40:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:40:07,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 551619955, now seen corresponding path program 1 times [2024-11-07 01:40:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020699345] [2024-11-07 01:40:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:08,072 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-07 01:40:08,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020699345] [2024-11-07 01:40:08,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020699345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:08,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54211970] [2024-11-07 01:40:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:08,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:08,074 INFO L87 Difference]: Start difference. First operand 2445 states and 3817 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 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-07 01:40:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:08,113 INFO L93 Difference]: Finished difference Result 2678 states and 4192 transitions. [2024-11-07 01:40:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 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-07 01:40:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:08,125 INFO L225 Difference]: With dead ends: 2678 [2024-11-07 01:40:08,125 INFO L226 Difference]: Without dead ends: 2556 [2024-11-07 01:40:08,126 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-07 01:40:08,126 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:40:08,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-11-07 01:40:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2552. [2024-11-07 01:40:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5635294117647058) internal successors, (3987), 2551 states have internal predecessors, (3987), 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-07 01:40:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3987 transitions. [2024-11-07 01:40:08,190 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3987 transitions. Word has length 92 [2024-11-07 01:40:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:08,190 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3987 transitions. [2024-11-07 01:40:08,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 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-07 01:40:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3987 transitions. [2024-11-07 01:40:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 01:40:08,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:08,192 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-07 01:40:08,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:40:08,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:08,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash 618113467, now seen corresponding path program 1 times [2024-11-07 01:40:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443655787] [2024-11-07 01:40:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:08,699 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-07 01:40:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443655787] [2024-11-07 01:40:08,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443655787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:08,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:08,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:40:08,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537905670] [2024-11-07 01:40:08,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:08,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:40:08,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:08,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:40:08,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:40:08,701 INFO L87 Difference]: Start difference. First operand 2552 states and 3987 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-07 01:40:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:09,138 INFO L93 Difference]: Finished difference Result 2783 states and 4355 transitions. [2024-11-07 01:40:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:40:09,139 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-07 01:40:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:09,149 INFO L225 Difference]: With dead ends: 2783 [2024-11-07 01:40:09,149 INFO L226 Difference]: Without dead ends: 2554 [2024-11-07 01:40:09,150 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-07 01:40:09,151 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 4611 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:40:09,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 2281 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:40:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2024-11-07 01:40:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2024-11-07 01:40:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5627450980392157) internal successors, (3985), 2551 states have internal predecessors, (3985), 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-07 01:40:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3985 transitions. [2024-11-07 01:40:09,206 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3985 transitions. Word has length 92 [2024-11-07 01:40:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3985 transitions. [2024-11-07 01:40:09,206 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-07 01:40:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3985 transitions. [2024-11-07 01:40:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:40:09,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:09,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:40:09,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:40:09,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1566925479, now seen corresponding path program 1 times [2024-11-07 01:40:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:09,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995168612] [2024-11-07 01:40:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:40:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995168612] [2024-11-07 01:40:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995168612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:09,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:40:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092499192] [2024-11-07 01:40:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:40:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:40:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:40:09,449 INFO L87 Difference]: Start difference. First operand 2552 states and 3985 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-07 01:40:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:09,484 INFO L93 Difference]: Finished difference Result 2560 states and 3994 transitions. [2024-11-07 01:40:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:40:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2024-11-07 01:40:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:09,492 INFO L225 Difference]: With dead ends: 2560 [2024-11-07 01:40:09,492 INFO L226 Difference]: Without dead ends: 2558 [2024-11-07 01:40:09,493 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-07 01:40:09,493 INFO L432 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6403 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:40:09,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6403 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2024-11-07 01:40:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2024-11-07 01:40:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.5610328638497653) internal successors, (3990), 2557 states have internal predecessors, (3990), 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-07 01:40:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3990 transitions. [2024-11-07 01:40:09,534 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3990 transitions. Word has length 93 [2024-11-07 01:40:09,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:09,534 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3990 transitions. [2024-11-07 01:40:09,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-07 01:40:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3990 transitions. [2024-11-07 01:40:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:40:09,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:09,537 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-07 01:40:09,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:40:09,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:09,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:09,537 INFO L85 PathProgramCache]: Analyzing trace with hash -401487589, now seen corresponding path program 1 times [2024-11-07 01:40:09,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:09,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125508220] [2024-11-07 01:40:09,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:09,613 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-07 01:40:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:09,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125508220] [2024-11-07 01:40:09,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125508220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:09,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928526346] [2024-11-07 01:40:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:09,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:09,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:09,615 INFO L87 Difference]: Start difference. First operand 2558 states and 3990 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:09,642 INFO L93 Difference]: Finished difference Result 3012 states and 4702 transitions. [2024-11-07 01:40:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:09,651 INFO L225 Difference]: With dead ends: 3012 [2024-11-07 01:40:09,651 INFO L226 Difference]: Without dead ends: 2777 [2024-11-07 01:40:09,652 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-07 01:40:09,652 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 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-07 01:40:09,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2024-11-07 01:40:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2024-11-07 01:40:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2773 states have (on average 1.560403894698882) internal successors, (4327), 2774 states have internal predecessors, (4327), 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-07 01:40:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4327 transitions. [2024-11-07 01:40:09,747 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4327 transitions. Word has length 94 [2024-11-07 01:40:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 4327 transitions. [2024-11-07 01:40:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4327 transitions. [2024-11-07 01:40:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:40:09,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:09,748 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-07 01:40:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:40:09,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:09,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1540581915, now seen corresponding path program 1 times [2024-11-07 01:40:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40272904] [2024-11-07 01:40:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:09,823 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-07 01:40:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40272904] [2024-11-07 01:40:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40272904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:09,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:09,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622647046] [2024-11-07 01:40:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:09,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:09,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:09,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:09,825 INFO L87 Difference]: Start difference. First operand 2775 states and 4327 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:09,874 INFO L93 Difference]: Finished difference Result 3647 states and 5685 transitions. [2024-11-07 01:40:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:09,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:09,886 INFO L225 Difference]: With dead ends: 3647 [2024-11-07 01:40:09,887 INFO L226 Difference]: Without dead ends: 3195 [2024-11-07 01:40:09,889 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-07 01:40:09,889 INFO L432 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 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-07 01:40:09,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2024-11-07 01:40:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3193. [2024-11-07 01:40:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3191 states have (on average 1.5571921027890943) internal successors, (4969), 3192 states have internal predecessors, (4969), 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-07 01:40:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4969 transitions. [2024-11-07 01:40:09,958 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4969 transitions. Word has length 94 [2024-11-07 01:40:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4969 transitions. [2024-11-07 01:40:09,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4969 transitions. [2024-11-07 01:40:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:40:09,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:09,960 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-07 01:40:09,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:40:09,960 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:09,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1967352859, now seen corresponding path program 1 times [2024-11-07 01:40:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:09,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24282866] [2024-11-07 01:40:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:09,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:10,026 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-07 01:40:10,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24282866] [2024-11-07 01:40:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24282866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:10,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631605272] [2024-11-07 01:40:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:10,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:10,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:10,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:10,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:10,028 INFO L87 Difference]: Start difference. First operand 3193 states and 4969 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:10,059 INFO L93 Difference]: Finished difference Result 4869 states and 7555 transitions. [2024-11-07 01:40:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:10,070 INFO L225 Difference]: With dead ends: 4869 [2024-11-07 01:40:10,070 INFO L226 Difference]: Without dead ends: 3999 [2024-11-07 01:40:10,072 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-07 01:40:10,073 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1786 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-07 01:40:10,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2024-11-07 01:40:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3997. [2024-11-07 01:40:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3995 states have (on average 1.5491864831038797) internal successors, (6189), 3996 states have internal predecessors, (6189), 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-07 01:40:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 6189 transitions. [2024-11-07 01:40:10,144 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 6189 transitions. Word has length 94 [2024-11-07 01:40:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:10,145 INFO L471 AbstractCegarLoop]: Abstraction has 3997 states and 6189 transitions. [2024-11-07 01:40:10,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 6189 transitions. [2024-11-07 01:40:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:40:10,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:10,148 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-07 01:40:10,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:40:10,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1089352421, now seen corresponding path program 1 times [2024-11-07 01:40:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636926538] [2024-11-07 01:40:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:10,228 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-07 01:40:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:10,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636926538] [2024-11-07 01:40:10,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636926538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:10,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613760423] [2024-11-07 01:40:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:10,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:10,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:10,230 INFO L87 Difference]: Start difference. First operand 3997 states and 6189 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:10,298 INFO L93 Difference]: Finished difference Result 7217 states and 11103 transitions. [2024-11-07 01:40:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:10,315 INFO L225 Difference]: With dead ends: 7217 [2024-11-07 01:40:10,318 INFO L226 Difference]: Without dead ends: 5543 [2024-11-07 01:40:10,322 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-07 01:40:10,323 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1788 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-07 01:40:10,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2024-11-07 01:40:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 5541. [2024-11-07 01:40:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5539 states have (on average 1.5347535656255642) internal successors, (8501), 5540 states have internal predecessors, (8501), 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-07 01:40:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 8501 transitions. [2024-11-07 01:40:10,447 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 8501 transitions. Word has length 94 [2024-11-07 01:40:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:10,448 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 8501 transitions. [2024-11-07 01:40:10,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 8501 transitions. [2024-11-07 01:40:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:40:10,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:10,449 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-07 01:40:10,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:40:10,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1523888357, now seen corresponding path program 1 times [2024-11-07 01:40:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:10,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762683977] [2024-11-07 01:40:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:10,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:10,525 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-07 01:40:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:10,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762683977] [2024-11-07 01:40:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762683977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:10,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:10,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135990932] [2024-11-07 01:40:10,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:10,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:10,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:10,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:10,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:10,528 INFO L87 Difference]: Start difference. First operand 5541 states and 8501 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:10,599 INFO L93 Difference]: Finished difference Result 11721 states and 17815 transitions. [2024-11-07 01:40:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:10,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:10,621 INFO L225 Difference]: With dead ends: 11721 [2024-11-07 01:40:10,621 INFO L226 Difference]: Without dead ends: 8503 [2024-11-07 01:40:10,627 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-07 01:40:10,628 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1784 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-07 01:40:10,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2024-11-07 01:40:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8501. [2024-11-07 01:40:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8499 states have (on average 1.5141781386045416) internal successors, (12869), 8500 states have internal predecessors, (12869), 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-07 01:40:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 12869 transitions. [2024-11-07 01:40:10,787 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 12869 transitions. Word has length 94 [2024-11-07 01:40:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:10,787 INFO L471 AbstractCegarLoop]: Abstraction has 8501 states and 12869 transitions. [2024-11-07 01:40:10,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 12869 transitions. [2024-11-07 01:40:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:40:10,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:10,788 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-07 01:40:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:40:10,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:10,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash 990146075, now seen corresponding path program 1 times [2024-11-07 01:40:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806766772] [2024-11-07 01:40:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:10,844 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-07 01:40:10,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:10,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806766772] [2024-11-07 01:40:10,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806766772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:10,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:10,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483265550] [2024-11-07 01:40:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:10,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:10,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:10,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:10,845 INFO L87 Difference]: Start difference. First operand 8501 states and 12869 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:11,050 INFO L93 Difference]: Finished difference Result 20345 states and 30471 transitions. [2024-11-07 01:40:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:11,076 INFO L225 Difference]: With dead ends: 20345 [2024-11-07 01:40:11,077 INFO L226 Difference]: Without dead ends: 14167 [2024-11-07 01:40:11,084 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-07 01:40:11,084 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1790 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-07 01:40:11,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2024-11-07 01:40:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 14165. [2024-11-07 01:40:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 14163 states have (on average 1.4893031137470876) internal successors, (21093), 14164 states have internal predecessors, (21093), 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-07 01:40:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 21093 transitions. [2024-11-07 01:40:11,354 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 21093 transitions. Word has length 94 [2024-11-07 01:40:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:11,355 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 21093 transitions. [2024-11-07 01:40:11,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 21093 transitions. [2024-11-07 01:40:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:40:11,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:11,356 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-07 01:40:11,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:40:11,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:11,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1703496475, now seen corresponding path program 1 times [2024-11-07 01:40:11,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:11,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341832708] [2024-11-07 01:40:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:11,411 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-07 01:40:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341832708] [2024-11-07 01:40:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341832708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90785270] [2024-11-07 01:40:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:11,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:11,412 INFO L87 Difference]: Start difference. First operand 14165 states and 21093 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:11,614 INFO L93 Difference]: Finished difference Result 36825 states and 54247 transitions. [2024-11-07 01:40:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:11,656 INFO L225 Difference]: With dead ends: 36825 [2024-11-07 01:40:11,656 INFO L226 Difference]: Without dead ends: 24983 [2024-11-07 01:40:11,672 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-07 01:40:11,672 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1792 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-07 01:40:11,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24983 states. [2024-11-07 01:40:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24983 to 24981. [2024-11-07 01:40:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24981 states, 24979 states have (on average 1.4619080027222868) internal successors, (36517), 24980 states have internal predecessors, (36517), 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-07 01:40:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 36517 transitions. [2024-11-07 01:40:12,278 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 36517 transitions. Word has length 94 [2024-11-07 01:40:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:12,278 INFO L471 AbstractCegarLoop]: Abstraction has 24981 states and 36517 transitions. [2024-11-07 01:40:12,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-07 01:40:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 36517 transitions. [2024-11-07 01:40:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 01:40:12,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:12,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:40:12,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:40:12,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1087415530, now seen corresponding path program 1 times [2024-11-07 01:40:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073624933] [2024-11-07 01:40:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:12,336 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-07 01:40:12,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073624933] [2024-11-07 01:40:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073624933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:40:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204980992] [2024-11-07 01:40:12,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:12,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:40:12,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:40:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:40:12,337 INFO L87 Difference]: Start difference. First operand 24981 states and 36517 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-07 01:40:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:12,768 INFO L93 Difference]: Finished difference Result 48540 states and 71083 transitions. [2024-11-07 01:40:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:40:12,769 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-07 01:40:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:12,821 INFO L225 Difference]: With dead ends: 48540 [2024-11-07 01:40:12,821 INFO L226 Difference]: Without dead ends: 35993 [2024-11-07 01:40:12,835 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-07 01:40:12,836 INFO L432 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 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-07 01:40:12,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:40:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35993 states. [2024-11-07 01:40:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35993 to 35991. [2024-11-07 01:40:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35991 states, 35989 states have (on average 1.4521937258606796) internal successors, (52263), 35990 states have internal predecessors, (52263), 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-07 01:40:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 52263 transitions. [2024-11-07 01:40:13,684 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 52263 transitions. Word has length 96 [2024-11-07 01:40:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:13,684 INFO L471 AbstractCegarLoop]: Abstraction has 35991 states and 52263 transitions. [2024-11-07 01:40:13,685 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-07 01:40:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 52263 transitions. [2024-11-07 01:40:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:40:13,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:13,691 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:40:13,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:40:13,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash 54573310, now seen corresponding path program 1 times [2024-11-07 01:40:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877889044] [2024-11-07 01:40:13,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:40:13,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:13,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877889044] [2024-11-07 01:40:13,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877889044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:13,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:13,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:40:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017608123] [2024-11-07 01:40:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:13,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:40:13,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:40:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:40:13,888 INFO L87 Difference]: Start difference. First operand 35991 states and 52263 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-07 01:40:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:17,744 INFO L93 Difference]: Finished difference Result 312105 states and 450864 transitions. [2024-11-07 01:40:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:40:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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 119 [2024-11-07 01:40:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:18,256 INFO L225 Difference]: With dead ends: 312105 [2024-11-07 01:40:18,256 INFO L226 Difference]: Without dead ends: 278439 [2024-11-07 01:40:18,351 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-07 01:40:18,353 INFO L432 NwaCegarLoop]: 1706 mSDtfsCounter, 11836 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11836 SdHoareTripleChecker+Valid, 5009 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:40:18,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11836 Valid, 5009 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:40:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278439 states. [2024-11-07 01:40:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278439 to 69655. [2024-11-07 01:40:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69655 states, 69653 states have (on average 1.4431395632636068) internal successors, (100519), 69654 states have internal predecessors, (100519), 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-07 01:40:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69655 states to 69655 states and 100519 transitions. [2024-11-07 01:40:21,729 INFO L78 Accepts]: Start accepts. Automaton has 69655 states and 100519 transitions. Word has length 119 [2024-11-07 01:40:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:21,730 INFO L471 AbstractCegarLoop]: Abstraction has 69655 states and 100519 transitions. [2024-11-07 01:40:21,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-07 01:40:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 69655 states and 100519 transitions. [2024-11-07 01:40:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:40:21,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:21,740 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:40:21,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:40:21,740 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:21,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1996642814, now seen corresponding path program 1 times [2024-11-07 01:40:21,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:21,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695060362] [2024-11-07 01:40:21,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 01:40:21,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:21,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695060362] [2024-11-07 01:40:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695060362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:21,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:21,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:40:21,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476077317] [2024-11-07 01:40:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:21,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:40:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:21,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:40:21,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:40:21,990 INFO L87 Difference]: Start difference. First operand 69655 states and 100519 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-07 01:40:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:40:28,044 INFO L93 Difference]: Finished difference Result 345769 states and 499120 transitions. [2024-11-07 01:40:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:40:28,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 119 [2024-11-07 01:40:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:40:28,533 INFO L225 Difference]: With dead ends: 345769 [2024-11-07 01:40:28,533 INFO L226 Difference]: Without dead ends: 312103 [2024-11-07 01:40:28,601 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-07 01:40:28,601 INFO L432 NwaCegarLoop]: 1703 mSDtfsCounter, 11886 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11886 SdHoareTripleChecker+Valid, 4806 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:40:28,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11886 Valid, 4806 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:40:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312103 states. [2024-11-07 01:40:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312103 to 120215. [2024-11-07 01:40:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120215 states, 120213 states have (on average 1.4356433996323192) internal successors, (172583), 120214 states have internal predecessors, (172583), 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-07 01:40:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120215 states to 120215 states and 172583 transitions. [2024-11-07 01:40:33,139 INFO L78 Accepts]: Start accepts. Automaton has 120215 states and 172583 transitions. Word has length 119 [2024-11-07 01:40:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:40:33,140 INFO L471 AbstractCegarLoop]: Abstraction has 120215 states and 172583 transitions. [2024-11-07 01:40:33,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-07 01:40:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 120215 states and 172583 transitions. [2024-11-07 01:40:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:40:33,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:40:33,148 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:40:33,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:40:33,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:40:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:40:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1871553538, now seen corresponding path program 1 times [2024-11-07 01:40:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:40:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493370240] [2024-11-07 01:40:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:40:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:40:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:40:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 01:40:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:40:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493370240] [2024-11-07 01:40:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493370240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:40:33,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:40:33,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:40:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650189793] [2024-11-07 01:40:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:40:33,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:40:33,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:40:33,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:40:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:40:33,428 INFO L87 Difference]: Start difference. First operand 120215 states and 172583 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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)