./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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', '333f7d871a28287888fc627bc2286b138e3dc4b4ae11f3e9e7973c97016726e5'] 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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 333f7d871a28287888fc627bc2286b138e3dc4b4ae11f3e9e7973c97016726e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:41:35,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:41:35,417 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:41:35,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:41:35,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:41:35,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:41:35,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:41:35,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:41:35,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:41:35,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:41:35,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:41:35,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:41:35,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:41:35,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:41:35,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:41:35,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:41:35,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:41:35,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:41:35,445 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 -> 333f7d871a28287888fc627bc2286b138e3dc4b4ae11f3e9e7973c97016726e5 [2024-11-07 01:41:35,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:41:35,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:41:35,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:41:35,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:41:35,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:41:35,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-07 01:41:36,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:41:37,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:41:37,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-07 01:41:37,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1adc756d/7d58adcd4f2e447fb2517388b989c0ab/FLAG62713ceef [2024-11-07 01:41:37,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1adc756d/7d58adcd4f2e447fb2517388b989c0ab [2024-11-07 01:41:37,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:41:37,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:41:37,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:41:37,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:41:37,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:41:37,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:37" (1/1) ... [2024-11-07 01:41:37,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c0994c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:37, skipping insertion in model container [2024-11-07 01:41:37,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:37" (1/1) ... [2024-11-07 01:41:37,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:41:37,612 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[26962,26975] [2024-11-07 01:41:37,646 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[34710,34723] [2024-11-07 01:41:37,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:41:38,012 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:41:38,049 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[26962,26975] [2024-11-07 01:41:38,063 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_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[34710,34723] [2024-11-07 01:41:38,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:41:38,306 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:41:38,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38 WrapperNode [2024-11-07 01:41:38,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:41:38,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:41:38,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:41:38,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:41:38,312 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:41:38" (1/1) ... [2024-11-07 01:41:38,343 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:41:38" (1/1) ... [2024-11-07 01:41:38,626 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5289 [2024-11-07 01:41:38,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:41:38,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:41:38,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:41:38,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:41:38,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:38,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:38,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:38,859 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:41:38,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:38,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:38,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:38,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:39,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:39,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:39,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:41:39,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:41:39,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:41:39,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:41:39,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (1/1) ... [2024-11-07 01:41:39,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:41:39,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:41:39,108 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:41:39,111 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:41:39,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:41:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:41:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:41:39,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:41:39,248 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:41:39,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:41:42,642 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-07 01:41:42,642 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:41:42,678 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:41:42,678 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 01:41:42,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:42 BoogieIcfgContainer [2024-11-07 01:41:42,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:41:42,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:41:42,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:41:42,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:41:42,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:41:37" (1/3) ... [2024-11-07 01:41:42,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e726b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:42, skipping insertion in model container [2024-11-07 01:41:42,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:38" (2/3) ... [2024-11-07 01:41:42,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e726b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:42, skipping insertion in model container [2024-11-07 01:41:42,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:42" (3/3) ... [2024-11-07 01:41:42,689 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-07 01:41:42,720 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:41:42,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:41:42,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:41:42,813 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;@46655ce0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:41:42,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:41:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 947 states, 944 states have (on average 1.9036016949152543) internal successors, (1797), 946 states have internal predecessors, (1797), 0 states have call successors, (0), 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:41:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 01:41:42,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:42,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:41:42,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash -60564882, now seen corresponding path program 1 times [2024-11-07 01:41:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922310533] [2024-11-07 01:41:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:43,088 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:41:43,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922310533] [2024-11-07 01:41:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922310533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:43,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:41:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848350993] [2024-11-07 01:41:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:43,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 01:41:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:43,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 01:41:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:41:43,108 INFO L87 Difference]: Start difference. First operand has 947 states, 944 states have (on average 1.9036016949152543) internal successors, (1797), 946 states have internal predecessors, (1797), 0 states have call successors, (0), 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:41:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:43,165 INFO L93 Difference]: Finished difference Result 1825 states and 3462 transitions. [2024-11-07 01:41:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 01:41:43,167 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:41:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:43,178 INFO L225 Difference]: With dead ends: 1825 [2024-11-07 01:41:43,178 INFO L226 Difference]: Without dead ends: 881 [2024-11-07 01:41:43,188 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:41:43,191 INFO L432 NwaCegarLoop]: 1728 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, 1728 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:41:43,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-07 01:41:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2024-11-07 01:41:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 880 states have internal predecessors, (1664), 0 states have call successors, (0), 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:41:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1664 transitions. [2024-11-07 01:41:43,268 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1664 transitions. Word has length 30 [2024-11-07 01:41:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:43,269 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1664 transitions. [2024-11-07 01:41:43,270 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:41:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1664 transitions. [2024-11-07 01:41:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 01:41:43,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:43,273 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:41:43,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:41:43,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:43,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash -194578388, now seen corresponding path program 1 times [2024-11-07 01:41:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:43,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408124107] [2024-11-07 01:41:43,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:43,537 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:41:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:43,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408124107] [2024-11-07 01:41:43,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408124107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:43,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:43,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:41:43,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695842990] [2024-11-07 01:41:43,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:43,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:41:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:43,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:41:43,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:41:43,539 INFO L87 Difference]: Start difference. First operand 881 states and 1664 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:41:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:43,643 INFO L93 Difference]: Finished difference Result 945 states and 1765 transitions. [2024-11-07 01:41:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:41:43,644 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:41:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:43,647 INFO L225 Difference]: With dead ends: 945 [2024-11-07 01:41:43,647 INFO L226 Difference]: Without dead ends: 881 [2024-11-07 01:41:43,648 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:41:43,648 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 0 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6582 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:41:43,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6582 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:41:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-07 01:41:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2024-11-07 01:41:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8236632536973834) internal successors, (1603), 880 states have internal predecessors, (1603), 0 states have call successors, (0), 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:41:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1603 transitions. [2024-11-07 01:41:43,664 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1603 transitions. Word has length 30 [2024-11-07 01:41:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1603 transitions. [2024-11-07 01:41:43,664 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:41:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1603 transitions. [2024-11-07 01:41:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:41:43,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:43,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:41:43,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1419712348, now seen corresponding path program 1 times [2024-11-07 01:41:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023124017] [2024-11-07 01:41:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:43,898 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:41:43,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:43,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023124017] [2024-11-07 01:41:43,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023124017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:43,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:43,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:43,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496414396] [2024-11-07 01:41:43,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:43,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:41:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:43,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:41:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:41:43,899 INFO L87 Difference]: Start difference. First operand 881 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:41:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:48,379 INFO L93 Difference]: Finished difference Result 3136 states and 5912 transitions. [2024-11-07 01:41:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:41:48,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 01:41:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:48,388 INFO L225 Difference]: With dead ends: 3136 [2024-11-07 01:41:48,388 INFO L226 Difference]: Without dead ends: 2383 [2024-11-07 01:41:48,388 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:41:48,389 INFO L432 NwaCegarLoop]: 857 mSDtfsCounter, 2513 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:48,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 875 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-07 01:41:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2024-11-07 01:41:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2024-11-07 01:41:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2381 states have (on average 1.50314993700126) internal successors, (3579), 2382 states have internal predecessors, (3579), 0 states have call successors, (0), 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:41:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3579 transitions. [2024-11-07 01:41:48,425 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3579 transitions. Word has length 67 [2024-11-07 01:41:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:48,451 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3579 transitions. [2024-11-07 01:41:48,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:41:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3579 transitions. [2024-11-07 01:41:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 01:41:48,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:48,453 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:41:48,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:41:48,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:48,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash 255619932, now seen corresponding path program 1 times [2024-11-07 01:41:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:48,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391960546] [2024-11-07 01:41:48,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:48,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:48,870 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:41:48,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:48,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391960546] [2024-11-07 01:41:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391960546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:48,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:48,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:48,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905435810] [2024-11-07 01:41:48,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:48,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:48,874 INFO L87 Difference]: Start difference. First operand 2383 states and 3579 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:41:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:49,252 INFO L93 Difference]: Finished difference Result 3343 states and 5131 transitions. [2024-11-07 01:41:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:41:49,252 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:41:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:49,261 INFO L225 Difference]: With dead ends: 3343 [2024-11-07 01:41:49,261 INFO L226 Difference]: Without dead ends: 3283 [2024-11-07 01:41:49,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-07 01:41:49,263 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 13373 mSDsluCounter, 4789 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13373 SdHoareTripleChecker+Valid, 6388 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:49,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13373 Valid, 6388 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:41:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2024-11-07 01:41:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2441. [2024-11-07 01:41:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5059450594505945) internal successors, (3673), 2440 states have internal predecessors, (3673), 0 states have call successors, (0), 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:41:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3673 transitions. [2024-11-07 01:41:49,300 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3673 transitions. Word has length 90 [2024-11-07 01:41:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:49,300 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3673 transitions. [2024-11-07 01:41:49,301 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:41:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3673 transitions. [2024-11-07 01:41:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 01:41:49,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:49,302 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:41:49,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:41:49,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:49,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash -578069748, now seen corresponding path program 1 times [2024-11-07 01:41:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:49,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283172541] [2024-11-07 01:41:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:49,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:49,417 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:41:49,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:49,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283172541] [2024-11-07 01:41:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283172541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:49,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:49,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:49,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205166983] [2024-11-07 01:41:49,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:49,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:49,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:49,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:49,418 INFO L87 Difference]: Start difference. First operand 2441 states and 3673 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:41:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:49,443 INFO L93 Difference]: Finished difference Result 2666 states and 4036 transitions. [2024-11-07 01:41:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:49,443 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:41:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:49,449 INFO L225 Difference]: With dead ends: 2666 [2024-11-07 01:41:49,450 INFO L226 Difference]: Without dead ends: 2548 [2024-11-07 01:41:49,450 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:41:49,451 INFO L432 NwaCegarLoop]: 1601 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:49,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-07 01:41:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2024-11-07 01:41:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5098270440251573) internal successors, (3841), 2545 states have internal predecessors, (3841), 0 states have call successors, (0), 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:41:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3841 transitions. [2024-11-07 01:41:49,537 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3841 transitions. Word has length 92 [2024-11-07 01:41:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3841 transitions. [2024-11-07 01:41:49,537 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:41:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3841 transitions. [2024-11-07 01:41:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 01:41:49,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:49,538 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:41:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:41:49,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash -511576236, now seen corresponding path program 1 times [2024-11-07 01:41:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640978734] [2024-11-07 01:41:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:49,907 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:41:49,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:49,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640978734] [2024-11-07 01:41:49,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640978734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:49,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:49,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:49,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731491949] [2024-11-07 01:41:49,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:49,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:49,909 INFO L87 Difference]: Start difference. First operand 2546 states and 3841 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:41:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:50,258 INFO L93 Difference]: Finished difference Result 2771 states and 4201 transitions. [2024-11-07 01:41:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:41:50,258 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:41:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:50,265 INFO L225 Difference]: With dead ends: 2771 [2024-11-07 01:41:50,266 INFO L226 Difference]: Without dead ends: 2548 [2024-11-07 01:41:50,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:41:50,267 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 6108 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6108 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:50,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6108 Valid, 2254 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:41:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-07 01:41:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2024-11-07 01:41:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5090408805031446) internal successors, (3839), 2545 states have internal predecessors, (3839), 0 states have call successors, (0), 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:41:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3839 transitions. [2024-11-07 01:41:50,298 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3839 transitions. Word has length 92 [2024-11-07 01:41:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:50,299 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3839 transitions. [2024-11-07 01:41:50,299 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:41:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3839 transitions. [2024-11-07 01:41:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:41:50,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:50,300 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:41:50,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:41:50,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash 906283047, now seen corresponding path program 1 times [2024-11-07 01:41:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404925860] [2024-11-07 01:41:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:41:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404925860] [2024-11-07 01:41:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404925860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:50,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:41:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387340396] [2024-11-07 01:41:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:50,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:41:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:41:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:41:50,516 INFO L87 Difference]: Start difference. First operand 2546 states and 3839 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:41:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:50,542 INFO L93 Difference]: Finished difference Result 2554 states and 3848 transitions. [2024-11-07 01:41:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:41:50,543 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:41:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:50,549 INFO L225 Difference]: With dead ends: 2554 [2024-11-07 01:41:50,549 INFO L226 Difference]: Without dead ends: 2552 [2024-11-07 01:41:50,550 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:41:50,550 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6391 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:41:50,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6391 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-11-07 01:41:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2024-11-07 01:41:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.507450980392157) internal successors, (3844), 2551 states have internal predecessors, (3844), 0 states have call successors, (0), 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:41:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3844 transitions. [2024-11-07 01:41:50,580 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3844 transitions. Word has length 93 [2024-11-07 01:41:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:50,581 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3844 transitions. [2024-11-07 01:41:50,581 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:41:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3844 transitions. [2024-11-07 01:41:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:50,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:50,582 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:41:50,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:41:50,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:50,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1719553388, now seen corresponding path program 1 times [2024-11-07 01:41:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303920460] [2024-11-07 01:41:50,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:50,645 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:41:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303920460] [2024-11-07 01:41:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303920460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14215900] [2024-11-07 01:41:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:50,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:50,646 INFO L87 Difference]: Start difference. First operand 2552 states and 3844 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:41:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:50,668 INFO L93 Difference]: Finished difference Result 2794 states and 4225 transitions. [2024-11-07 01:41:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:50,669 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:41:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:50,675 INFO L225 Difference]: With dead ends: 2794 [2024-11-07 01:41:50,675 INFO L226 Difference]: Without dead ends: 2670 [2024-11-07 01:41:50,676 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:41:50,677 INFO L432 NwaCegarLoop]: 1685 mSDtfsCounter, 1526 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1783 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:41:50,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2024-11-07 01:41:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2668. [2024-11-07 01:41:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5097524381095273) internal successors, (4025), 2667 states have internal predecessors, (4025), 0 states have call successors, (0), 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:41:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4025 transitions. [2024-11-07 01:41:50,711 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4025 transitions. Word has length 94 [2024-11-07 01:41:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:50,711 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4025 transitions. [2024-11-07 01:41:50,711 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:41:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4025 transitions. [2024-11-07 01:41:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:50,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:50,712 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:41:50,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:41:50,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:50,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:50,712 INFO L85 PathProgramCache]: Analyzing trace with hash 593433492, now seen corresponding path program 1 times [2024-11-07 01:41:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:50,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669159007] [2024-11-07 01:41:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:50,777 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:41:50,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:50,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669159007] [2024-11-07 01:41:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669159007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:50,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:50,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:50,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107309235] [2024-11-07 01:41:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:50,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:50,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:50,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:50,778 INFO L87 Difference]: Start difference. First operand 2668 states and 4025 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:41:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:50,807 INFO L93 Difference]: Finished difference Result 3330 states and 5065 transitions. [2024-11-07 01:41:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:50,807 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:41:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:50,814 INFO L225 Difference]: With dead ends: 3330 [2024-11-07 01:41:50,815 INFO L226 Difference]: Without dead ends: 2987 [2024-11-07 01:41:50,815 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:41:50,816 INFO L432 NwaCegarLoop]: 1687 mSDtfsCounter, 1524 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 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:41:50,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 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:41:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-11-07 01:41:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2985. [2024-11-07 01:41:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2983 states have (on average 1.5142474019443513) internal successors, (4517), 2984 states have internal predecessors, (4517), 0 states have call successors, (0), 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:41:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4517 transitions. [2024-11-07 01:41:50,856 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4517 transitions. Word has length 94 [2024-11-07 01:41:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:50,856 INFO L471 AbstractCegarLoop]: Abstraction has 2985 states and 4517 transitions. [2024-11-07 01:41:50,856 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:41:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4517 transitions. [2024-11-07 01:41:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:50,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:50,857 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:41:50,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:41:50,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:50,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1596549740, now seen corresponding path program 1 times [2024-11-07 01:41:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937933561] [2024-11-07 01:41:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:51,015 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:41:51,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937933561] [2024-11-07 01:41:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937933561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:51,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:51,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695062584] [2024-11-07 01:41:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:51,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:51,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:51,020 INFO L87 Difference]: Start difference. First operand 2985 states and 4517 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:41:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:51,051 INFO L93 Difference]: Finished difference Result 4257 states and 6499 transitions. [2024-11-07 01:41:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:51,052 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:41:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:51,065 INFO L225 Difference]: With dead ends: 4257 [2024-11-07 01:41:51,066 INFO L226 Difference]: Without dead ends: 3597 [2024-11-07 01:41:51,071 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:41:51,071 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1520 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1785 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:41:51,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2024-11-07 01:41:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3595. [2024-11-07 01:41:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3593 states have (on average 1.5176732535485666) internal successors, (5453), 3594 states have internal predecessors, (5453), 0 states have call successors, (0), 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:41:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 5453 transitions. [2024-11-07 01:41:51,194 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 5453 transitions. Word has length 94 [2024-11-07 01:41:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:51,194 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 5453 transitions. [2024-11-07 01:41:51,194 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:41:51,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 5453 transitions. [2024-11-07 01:41:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:51,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:51,195 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:41:51,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:41:51,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:51,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1332693356, now seen corresponding path program 1 times [2024-11-07 01:41:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311673673] [2024-11-07 01:41:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:51,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:51,264 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:41:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:51,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311673673] [2024-11-07 01:41:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311673673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:51,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:51,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816873815] [2024-11-07 01:41:51,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:51,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:51,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:51,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:51,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:51,266 INFO L87 Difference]: Start difference. First operand 3595 states and 5453 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:41:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:51,306 INFO L93 Difference]: Finished difference Result 6039 states and 9223 transitions. [2024-11-07 01:41:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:51,307 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:41:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:51,321 INFO L225 Difference]: With dead ends: 6039 [2024-11-07 01:41:51,322 INFO L226 Difference]: Without dead ends: 4769 [2024-11-07 01:41:51,324 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:41:51,325 INFO L432 NwaCegarLoop]: 1673 mSDtfsCounter, 1518 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1787 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:41:51,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2024-11-07 01:41:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4767. [2024-11-07 01:41:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4765 states have (on average 1.5171038824763903) internal successors, (7229), 4766 states have internal predecessors, (7229), 0 states have call successors, (0), 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:41:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 7229 transitions. [2024-11-07 01:41:51,405 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 7229 transitions. Word has length 94 [2024-11-07 01:41:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:51,406 INFO L471 AbstractCegarLoop]: Abstraction has 4767 states and 7229 transitions. [2024-11-07 01:41:51,406 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:41:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 7229 transitions. [2024-11-07 01:41:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:51,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:51,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:41:51,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:51,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash -94431340, now seen corresponding path program 1 times [2024-11-07 01:41:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:51,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384153117] [2024-11-07 01:41:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:51,473 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:41:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384153117] [2024-11-07 01:41:51,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384153117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:51,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:51,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554952015] [2024-11-07 01:41:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:51,475 INFO L87 Difference]: Start difference. First operand 4767 states and 7229 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:41:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:51,558 INFO L93 Difference]: Finished difference Result 9459 states and 14383 transitions. [2024-11-07 01:41:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:51,558 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:41:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:51,569 INFO L225 Difference]: With dead ends: 9459 [2024-11-07 01:41:51,569 INFO L226 Difference]: Without dead ends: 7017 [2024-11-07 01:41:51,572 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:41:51,572 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1516 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 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:41:51,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 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:41:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2024-11-07 01:41:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 7015. [2024-11-07 01:41:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7015 states, 7013 states have (on average 1.5099101668330244) internal successors, (10589), 7014 states have internal predecessors, (10589), 0 states have call successors, (0), 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:41:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 10589 transitions. [2024-11-07 01:41:51,679 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 10589 transitions. Word has length 94 [2024-11-07 01:41:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:51,679 INFO L471 AbstractCegarLoop]: Abstraction has 7015 states and 10589 transitions. [2024-11-07 01:41:51,679 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:41:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 10589 transitions. [2024-11-07 01:41:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:51,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:51,680 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:41:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:41:51,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:51,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1985067156, now seen corresponding path program 1 times [2024-11-07 01:41:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544624753] [2024-11-07 01:41:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:51,740 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:41:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544624753] [2024-11-07 01:41:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544624753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216316195] [2024-11-07 01:41:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:51,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:51,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:51,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:51,741 INFO L87 Difference]: Start difference. First operand 7015 states and 10589 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:41:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:51,889 INFO L93 Difference]: Finished difference Result 16011 states and 24127 transitions. [2024-11-07 01:41:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:51,889 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:41:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:51,906 INFO L225 Difference]: With dead ends: 16011 [2024-11-07 01:41:51,906 INFO L226 Difference]: Without dead ends: 11321 [2024-11-07 01:41:51,910 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:41:51,911 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 1514 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1791 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:41:51,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11321 states. [2024-11-07 01:41:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11321 to 11319. [2024-11-07 01:41:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11319 states, 11317 states have (on average 1.4955376866660777) internal successors, (16925), 11318 states have internal predecessors, (16925), 0 states have call successors, (0), 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:41:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11319 states to 11319 states and 16925 transitions. [2024-11-07 01:41:52,164 INFO L78 Accepts]: Start accepts. Automaton has 11319 states and 16925 transitions. Word has length 94 [2024-11-07 01:41:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:52,164 INFO L471 AbstractCegarLoop]: Abstraction has 11319 states and 16925 transitions. [2024-11-07 01:41:52,164 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:41:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11319 states and 16925 transitions. [2024-11-07 01:41:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:52,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:52,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:41:52,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:41:52,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash -528967276, now seen corresponding path program 1 times [2024-11-07 01:41:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248553682] [2024-11-07 01:41:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:52,246 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:41:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:52,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248553682] [2024-11-07 01:41:52,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248553682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:52,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703153845] [2024-11-07 01:41:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:52,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:52,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:52,248 INFO L87 Difference]: Start difference. First operand 11319 states and 16925 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:41:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:52,488 INFO L93 Difference]: Finished difference Result 28539 states and 42463 transitions. [2024-11-07 01:41:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:52,489 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:41:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:52,515 INFO L225 Difference]: With dead ends: 28539 [2024-11-07 01:41:52,515 INFO L226 Difference]: Without dead ends: 19545 [2024-11-07 01:41:52,522 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:41:52,523 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1512 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1793 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:41:52,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1793 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19545 states. [2024-11-07 01:41:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19545 to 19543. [2024-11-07 01:41:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19543 states, 19541 states have (on average 1.475308326083619) internal successors, (28829), 19542 states have internal predecessors, (28829), 0 states have call successors, (0), 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:41:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 28829 transitions. [2024-11-07 01:41:52,841 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 28829 transitions. Word has length 94 [2024-11-07 01:41:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:52,841 INFO L471 AbstractCegarLoop]: Abstraction has 19543 states and 28829 transitions. [2024-11-07 01:41:52,841 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:41:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 28829 transitions. [2024-11-07 01:41:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 01:41:52,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:52,842 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:41:52,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:41:52,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:52,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1759464300, now seen corresponding path program 1 times [2024-11-07 01:41:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277100248] [2024-11-07 01:41:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:52,931 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:41:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277100248] [2024-11-07 01:41:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277100248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:52,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:41:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564146813] [2024-11-07 01:41:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:52,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:41:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:41:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:41:52,932 INFO L87 Difference]: Start difference. First operand 19543 states and 28829 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:41:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:53,325 INFO L93 Difference]: Finished difference Result 52443 states and 76831 transitions. [2024-11-07 01:41:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:41:53,333 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:41:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:53,419 INFO L225 Difference]: With dead ends: 52443 [2024-11-07 01:41:53,419 INFO L226 Difference]: Without dead ends: 35225 [2024-11-07 01:41:53,438 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:41:53,445 INFO L432 NwaCegarLoop]: 1685 mSDtfsCounter, 1522 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1791 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:41:53,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:41:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35225 states. [2024-11-07 01:41:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35225 to 35223. [2024-11-07 01:41:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35223 states, 35221 states have (on average 1.4508673802560972) internal successors, (51101), 35222 states have internal predecessors, (51101), 0 states have call successors, (0), 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:41:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 51101 transitions. [2024-11-07 01:41:54,116 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 51101 transitions. Word has length 94 [2024-11-07 01:41:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:41:54,116 INFO L471 AbstractCegarLoop]: Abstraction has 35223 states and 51101 transitions. [2024-11-07 01:41:54,116 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:41:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 51101 transitions. [2024-11-07 01:41:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:41:54,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:41:54,123 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:41:54,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:41:54,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:41:54,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:41:54,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1733023753, now seen corresponding path program 1 times [2024-11-07 01:41:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:41:54,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810669319] [2024-11-07 01:41:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:41:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:41:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:41:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:41:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:41:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810669319] [2024-11-07 01:41:54,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810669319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:41:54,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:41:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:41:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458130687] [2024-11-07 01:41:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:41:54,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:41:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:41:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:41:54,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:41:54,453 INFO L87 Difference]: Start difference. First operand 35223 states and 51101 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:41:57,734 INFO L93 Difference]: Finished difference Result 295209 states and 427174 transitions. [2024-11-07 01:41:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:41:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:41:58,267 INFO L225 Difference]: With dead ends: 295209 [2024-11-07 01:41:58,267 INFO L226 Difference]: Without dead ends: 272167 [2024-11-07 01:41:58,317 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:41:58,317 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 11707 mSDsluCounter, 3547 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11707 SdHoareTripleChecker+Valid, 5248 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:41:58,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11707 Valid, 5248 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:41:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272167 states. [2024-11-07 01:42:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272167 to 63255. [2024-11-07 01:42:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63255 states, 63253 states have (on average 1.4432991320569775) internal successors, (91293), 63254 states have internal predecessors, (91293), 0 states have call successors, (0), 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:42:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63255 states to 63255 states and 91293 transitions. [2024-11-07 01:42:00,762 INFO L78 Accepts]: Start accepts. Automaton has 63255 states and 91293 transitions. Word has length 119 [2024-11-07 01:42:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:00,763 INFO L471 AbstractCegarLoop]: Abstraction has 63255 states and 91293 transitions. [2024-11-07 01:42:00,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 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:42:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 63255 states and 91293 transitions. [2024-11-07 01:42:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:42:00,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:00,772 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:42:00,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:42:00,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:00,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:00,773 INFO L85 PathProgramCache]: Analyzing trace with hash 579963127, now seen corresponding path program 1 times [2024-11-07 01:42:00,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:00,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710269982] [2024-11-07 01:42:00,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:00,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:00,970 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:42:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710269982] [2024-11-07 01:42:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710269982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:00,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:42:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125186204] [2024-11-07 01:42:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:00,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:42:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:00,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:42:00,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:42:00,972 INFO L87 Difference]: Start difference. First operand 63255 states and 91293 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:42:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:05,691 INFO L93 Difference]: Finished difference Result 328105 states and 474534 transitions. [2024-11-07 01:42:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:05,692 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:42:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:06,250 INFO L225 Difference]: With dead ends: 328105 [2024-11-07 01:42:06,250 INFO L226 Difference]: Without dead ends: 295207 [2024-11-07 01:42:06,315 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:42:06,316 INFO L432 NwaCegarLoop]: 1700 mSDtfsCounter, 11709 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11709 SdHoareTripleChecker+Valid, 5195 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:06,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11709 Valid, 5195 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:42:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295207 states. [2024-11-07 01:42:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295207 to 107671. [2024-11-07 01:42:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107671 states, 107669 states have (on average 1.4387521013476487) internal successors, (154909), 107670 states have internal predecessors, (154909), 0 states have call successors, (0), 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:42:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107671 states to 107671 states and 154909 transitions. [2024-11-07 01:42:10,411 INFO L78 Accepts]: Start accepts. Automaton has 107671 states and 154909 transitions. Word has length 119 [2024-11-07 01:42:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:10,412 INFO L471 AbstractCegarLoop]: Abstraction has 107671 states and 154909 transitions. [2024-11-07 01:42:10,412 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:42:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 107671 states and 154909 transitions. [2024-11-07 01:42:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:42:10,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:10,425 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:42:10,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:42:10,425 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:10,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1610020105, now seen corresponding path program 1 times [2024-11-07 01:42:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:10,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756826654] [2024-11-07 01:42:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 01:42:10,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:10,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756826654] [2024-11-07 01:42:10,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756826654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:10,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:10,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:42:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253458491] [2024-11-07 01:42:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:10,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:42:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:42:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:42:10,676 INFO L87 Difference]: Start difference. First operand 107671 states and 154909 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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:42:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:17,385 INFO L93 Difference]: Finished difference Result 361001 states and 521766 transitions. [2024-11-07 01:42:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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:42:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:17,965 INFO L225 Difference]: With dead ends: 361001 [2024-11-07 01:42:17,965 INFO L226 Difference]: Without dead ends: 328103 [2024-11-07 01:42:18,037 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:42:18,038 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 11751 mSDsluCounter, 3518 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11751 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:18,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11751 Valid, 5216 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328103 states. [2024-11-07 01:42:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328103 to 140567. [2024-11-07 01:42:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140567 states, 140565 states have (on average 1.4380606836694767) internal successors, (202141), 140566 states have internal predecessors, (202141), 0 states have call successors, (0), 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:42:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140567 states to 140567 states and 202141 transitions. [2024-11-07 01:42:22,870 INFO L78 Accepts]: Start accepts. Automaton has 140567 states and 202141 transitions. Word has length 119 [2024-11-07 01:42:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:22,870 INFO L471 AbstractCegarLoop]: Abstraction has 140567 states and 202141 transitions. [2024-11-07 01:42:22,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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:42:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 140567 states and 202141 transitions. [2024-11-07 01:42:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 01:42:22,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:22,881 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:42:22,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:42:22,882 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:22,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:22,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1346163721, now seen corresponding path program 1 times [2024-11-07 01:42:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:22,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825621588] [2024-11-07 01:42:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:23,266 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:42:23,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:23,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825621588] [2024-11-07 01:42:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825621588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 01:42:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640885108] [2024-11-07 01:42:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:23,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:42:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:42:23,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:42:23,268 INFO L87 Difference]: Start difference. First operand 140567 states and 202141 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)