./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-2.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/Problem05_label46+token_ring.13.cil-2.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', '29f58006f2dcb74445f74971d42059f9136b4de9a536aa3c519655ea459ca984'] 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/Problem05_label46+token_ring.13.cil-2.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 29f58006f2dcb74445f74971d42059f9136b4de9a536aa3c519655ea459ca984 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:06:37,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:06:37,121 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:06:37,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:06:37,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:06:37,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:06:37,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:06:37,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:06:37,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:06:37,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:06:37,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:06:37,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:06:37,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:06:37,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:06:37,163 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:06:37,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:06:37,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:06:37,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:06:37,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:06:37,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:06:37,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:06:37,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:06:37,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:06:37,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:06:37,164 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:06:37,164 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:06:37,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:06:37,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:06:37,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:06:37,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:06:37,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:06:37,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:06:37,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:06:37,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:06:37,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:06:37,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:06:37,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:06:37,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:06:37,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:06:37,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:06:37,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:06:37,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:06:37,167 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 -> 29f58006f2dcb74445f74971d42059f9136b4de9a536aa3c519655ea459ca984 [2024-11-07 01:06:37,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:06:37,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:06:37,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:06:37,473 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:06:37,473 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:06:37,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-2.c [2024-11-07 01:06:38,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:06:39,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:06:39,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-2.c [2024-11-07 01:06:39,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cc1c47b3/96bf396b751b47a693b37766c3fc1fb3/FLAGb2b7ed5ed [2024-11-07 01:06:39,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cc1c47b3/96bf396b751b47a693b37766c3fc1fb3 [2024-11-07 01:06:39,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:06:39,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:06:39,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:06:39,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:06:39,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:06:39,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:39" (1/1) ... [2024-11-07 01:06:39,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4035aad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:39, skipping insertion in model container [2024-11-07 01:06:39,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:39" (1/1) ... [2024-11-07 01:06:40,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:06:41,358 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/Problem05_label46+token_ring.13.cil-2.c[382357,382370] [2024-11-07 01:06:41,390 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/Problem05_label46+token_ring.13.cil-2.c[383339,383352] [2024-11-07 01:06:41,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:06:41,685 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:06:42,313 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/Problem05_label46+token_ring.13.cil-2.c[382357,382370] [2024-11-07 01:06:42,318 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/Problem05_label46+token_ring.13.cil-2.c[383339,383352] [2024-11-07 01:06:42,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:06:42,498 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:06:42,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42 WrapperNode [2024-11-07 01:06:42,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:06:42,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:06:42,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:06:42,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:06:42,521 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:06:42" (1/1) ... [2024-11-07 01:06:42,642 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:06:42" (1/1) ... [2024-11-07 01:06:43,138 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-11-07 01:06:43,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:06:43,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:06:43,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:06:43,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:06:43,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,353 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:06:43,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:06:43,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:06:43,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:06:43,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:06:43,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (1/1) ... [2024-11-07 01:06:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:06:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:06:43,830 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:06:43,835 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:06:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:06:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:06:43,858 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:06:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:06:43,858 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:06:43,858 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:06:43,859 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:06:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:06:43,859 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:06:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:06:43,859 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:06:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:06:43,859 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:06:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:06:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:06:43,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:06:44,023 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:06:44,025 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:06:52,466 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-11-07 01:06:52,467 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:06:52,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:06:52,537 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-07 01:06:52,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:52 BoogieIcfgContainer [2024-11-07 01:06:52,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:06:52,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:06:52,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:06:52,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:06:52,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:39" (1/3) ... [2024-11-07 01:06:52,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344907bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:52, skipping insertion in model container [2024-11-07 01:06:52,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42" (2/3) ... [2024-11-07 01:06:52,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344907bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:52, skipping insertion in model container [2024-11-07 01:06:52,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:52" (3/3) ... [2024-11-07 01:06:52,549 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.13.cil-2.c [2024-11-07 01:06:52,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:06:52,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:06:52,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:06:52,713 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;@131fdd4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:06:52,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:06:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 2604 states, 2568 states have (on average 1.837227414330218) internal successors, (4718), 2571 states have internal predecessors, (4718), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:06:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:06:52,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:06:52,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:52,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:06:52,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:06:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash -481144573, now seen corresponding path program 1 times [2024-11-07 01:06:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:06:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624715305] [2024-11-07 01:06:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:06:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:06:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:06:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:06:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:06:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:06:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:06:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:53,518 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:06:53,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:06:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624715305] [2024-11-07 01:06:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624715305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:06:53,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:06:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:06:53,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275472143] [2024-11-07 01:06:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:06:53,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:06:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:06:53,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:06:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:06:53,562 INFO L87 Difference]: Start difference. First operand has 2604 states, 2568 states have (on average 1.837227414330218) internal successors, (4718), 2571 states have internal predecessors, (4718), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:06:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:06:55,908 INFO L93 Difference]: Finished difference Result 5353 states and 9793 transitions. [2024-11-07 01:06:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:06:55,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:06:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:06:55,949 INFO L225 Difference]: With dead ends: 5353 [2024-11-07 01:06:55,950 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 01:06:55,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:06:55,967 INFO L432 NwaCegarLoop]: 4406 mSDtfsCounter, 1125 mSDsluCounter, 12519 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 16925 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:06:55,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 16925 Invalid, 1171 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:06:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 01:06:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 01:06:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.819744204636291) internal successors, (4553), 2504 states have internal predecessors, (4553), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:06:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4607 transitions. [2024-11-07 01:06:56,167 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4607 transitions. Word has length 189 [2024-11-07 01:06:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:06:56,168 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4607 transitions. [2024-11-07 01:06:56,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:06:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4607 transitions. [2024-11-07 01:06:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:06:56,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:06:56,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:06:56,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:06:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:06:56,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1484842181, now seen corresponding path program 1 times [2024-11-07 01:06:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:06:56,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99933080] [2024-11-07 01:06:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:06:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:06:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:06:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:56,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:06:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:06:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:06:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:56,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:06:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:56,578 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:06:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:06:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99933080] [2024-11-07 01:06:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99933080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:06:56,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:06:56,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:06:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678578657] [2024-11-07 01:06:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:06:56,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:06:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:06:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:06:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:06:56,585 INFO L87 Difference]: Start difference. First operand 2537 states and 4607 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:06:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:06:58,691 INFO L93 Difference]: Finished difference Result 3089 states and 5491 transitions. [2024-11-07 01:06:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:06:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:06:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:06:58,788 INFO L225 Difference]: With dead ends: 3089 [2024-11-07 01:06:58,789 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 01:06:58,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:06:58,791 INFO L432 NwaCegarLoop]: 4336 mSDtfsCounter, 1111 mSDsluCounter, 12316 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 16652 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:06:58,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 16652 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:06:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 01:06:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 01:06:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.8193445243804955) internal successors, (4552), 2504 states have internal predecessors, (4552), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:06:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4606 transitions. [2024-11-07 01:06:58,875 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4606 transitions. Word has length 189 [2024-11-07 01:06:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:06:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4606 transitions. [2024-11-07 01:06:58,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:06:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4606 transitions. [2024-11-07 01:06:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:06:58,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:06:58,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:58,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:06:58,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:06:58,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:06:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1307026809, now seen corresponding path program 1 times [2024-11-07 01:06:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:06:58,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776195287] [2024-11-07 01:06:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:06:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:06:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:06:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:59,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:06:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:06:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:06:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:59,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:06:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:06:59,286 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:06:59,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:06:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776195287] [2024-11-07 01:06:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776195287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:06:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:06:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:06:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279956216] [2024-11-07 01:06:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:06:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:06:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:06:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:06:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:06:59,289 INFO L87 Difference]: Start difference. First operand 2537 states and 4606 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:02,461 INFO L93 Difference]: Finished difference Result 3653 states and 6401 transitions. [2024-11-07 01:07:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:07:02,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:02,477 INFO L225 Difference]: With dead ends: 3653 [2024-11-07 01:07:02,477 INFO L226 Difference]: Without dead ends: 3258 [2024-11-07 01:07:02,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:07:02,480 INFO L432 NwaCegarLoop]: 4304 mSDtfsCounter, 5646 mSDsluCounter, 12935 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5666 SdHoareTripleChecker+Valid, 17239 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:02,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5666 Valid, 17239 Invalid, 2544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 01:07:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2024-11-07 01:07:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2953. [2024-11-07 01:07:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2889 states have (on average 1.7871235721703012) internal successors, (5163), 2892 states have internal predecessors, (5163), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-11-07 01:07:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5264 transitions. [2024-11-07 01:07:02,584 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 5264 transitions. Word has length 189 [2024-11-07 01:07:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 5264 transitions. [2024-11-07 01:07:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 5264 transitions. [2024-11-07 01:07:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:02,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:02,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:02,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:07:02,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash 711601675, now seen corresponding path program 1 times [2024-11-07 01:07:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283904745] [2024-11-07 01:07:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:02,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:03,011 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:07:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283904745] [2024-11-07 01:07:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283904745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627375385] [2024-11-07 01:07:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:03,013 INFO L87 Difference]: Start difference. First operand 2953 states and 5264 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:06,867 INFO L93 Difference]: Finished difference Result 4659 states and 8012 transitions. [2024-11-07 01:07:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:06,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:06,892 INFO L225 Difference]: With dead ends: 4659 [2024-11-07 01:07:06,892 INFO L226 Difference]: Without dead ends: 3848 [2024-11-07 01:07:06,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:06,898 INFO L432 NwaCegarLoop]: 4572 mSDtfsCounter, 5693 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5713 SdHoareTripleChecker+Valid, 22527 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:06,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5713 Valid, 22527 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 01:07:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2024-11-07 01:07:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3340. [2024-11-07 01:07:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3340 states, 3247 states have (on average 1.760394210040037) internal successors, (5716), 3251 states have internal predecessors, (5716), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-11-07 01:07:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 5863 transitions. [2024-11-07 01:07:07,032 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 5863 transitions. Word has length 189 [2024-11-07 01:07:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:07,032 INFO L471 AbstractCegarLoop]: Abstraction has 3340 states and 5863 transitions. [2024-11-07 01:07:07,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 5863 transitions. [2024-11-07 01:07:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:07,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:07,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:07,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:07:07,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:07,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1013006647, now seen corresponding path program 1 times [2024-11-07 01:07:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643767552] [2024-11-07 01:07:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:07,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:07,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:07,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643767552] [2024-11-07 01:07:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643767552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:07,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189098723] [2024-11-07 01:07:07,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:07,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:07,403 INFO L87 Difference]: Start difference. First operand 3340 states and 5863 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:11,414 INFO L93 Difference]: Finished difference Result 6142 states and 10367 transitions. [2024-11-07 01:07:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:11,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:11,444 INFO L225 Difference]: With dead ends: 6142 [2024-11-07 01:07:11,444 INFO L226 Difference]: Without dead ends: 4944 [2024-11-07 01:07:11,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:11,453 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5687 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5707 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:11,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5707 Valid, 22525 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3824 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 01:07:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2024-11-07 01:07:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4118. [2024-11-07 01:07:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4118 states, 3967 states have (on average 1.7214519788253089) internal successors, (6829), 3973 states have internal predecessors, (6829), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-07 01:07:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 7072 transitions. [2024-11-07 01:07:11,701 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 7072 transitions. Word has length 189 [2024-11-07 01:07:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:11,701 INFO L471 AbstractCegarLoop]: Abstraction has 4118 states and 7072 transitions. [2024-11-07 01:07:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 7072 transitions. [2024-11-07 01:07:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:11,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:11,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:11,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:07:11,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:11,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -442734841, now seen corresponding path program 1 times [2024-11-07 01:07:11,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:11,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122714663] [2024-11-07 01:07:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:12,038 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:07:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:12,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122714663] [2024-11-07 01:07:12,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122714663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:12,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021356306] [2024-11-07 01:07:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:12,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:12,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:12,042 INFO L87 Difference]: Start difference. First operand 4118 states and 7072 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:15,946 INFO L93 Difference]: Finished difference Result 9002 states and 14876 transitions. [2024-11-07 01:07:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:15,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:15,981 INFO L225 Difference]: With dead ends: 9002 [2024-11-07 01:07:15,981 INFO L226 Difference]: Without dead ends: 7026 [2024-11-07 01:07:15,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:15,989 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5686 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3811 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5706 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:15,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5706 Valid, 22525 Invalid, 3876 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3811 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 01:07:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2024-11-07 01:07:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 5675. [2024-11-07 01:07:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5675 states, 5408 states have (on average 1.674371301775148) internal successors, (9055), 5418 states have internal predecessors, (9055), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-07 01:07:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5675 states to 5675 states and 9496 transitions. [2024-11-07 01:07:16,210 INFO L78 Accepts]: Start accepts. Automaton has 5675 states and 9496 transitions. Word has length 189 [2024-11-07 01:07:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:16,211 INFO L471 AbstractCegarLoop]: Abstraction has 5675 states and 9496 transitions. [2024-11-07 01:07:16,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5675 states and 9496 transitions. [2024-11-07 01:07:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:16,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:16,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:16,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:07:16,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:16,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 961134345, now seen corresponding path program 1 times [2024-11-07 01:07:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728924579] [2024-11-07 01:07:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:16,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:16,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:16,551 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:07:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:16,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728924579] [2024-11-07 01:07:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728924579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:16,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082901635] [2024-11-07 01:07:16,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:16,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:16,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:16,553 INFO L87 Difference]: Start difference. First operand 5675 states and 9496 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:20,779 INFO L93 Difference]: Finished difference Result 14721 states and 23910 transitions. [2024-11-07 01:07:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:20,823 INFO L225 Difference]: With dead ends: 14721 [2024-11-07 01:07:20,824 INFO L226 Difference]: Without dead ends: 11188 [2024-11-07 01:07:20,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:20,838 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5685 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5705 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:20,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5705 Valid, 22525 Invalid, 3863 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 01:07:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11188 states. [2024-11-07 01:07:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11188 to 8796. [2024-11-07 01:07:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8796 states, 8297 states have (on average 1.629143063757985) internal successors, (13517), 8315 states have internal predecessors, (13517), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-07 01:07:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8796 states to 8796 states and 14372 transitions. [2024-11-07 01:07:21,343 INFO L78 Accepts]: Start accepts. Automaton has 8796 states and 14372 transitions. Word has length 189 [2024-11-07 01:07:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:21,344 INFO L471 AbstractCegarLoop]: Abstraction has 8796 states and 14372 transitions. [2024-11-07 01:07:21,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 8796 states and 14372 transitions. [2024-11-07 01:07:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:21,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:21,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:07:21,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 175136455, now seen corresponding path program 1 times [2024-11-07 01:07:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561523563] [2024-11-07 01:07:21,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:21,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,659 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:07:21,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:21,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561523563] [2024-11-07 01:07:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561523563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:21,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:21,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:21,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72106752] [2024-11-07 01:07:21,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:21,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:21,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:21,661 INFO L87 Difference]: Start difference. First operand 8796 states and 14372 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:25,707 INFO L93 Difference]: Finished difference Result 26160 states and 42040 transitions. [2024-11-07 01:07:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:25,773 INFO L225 Difference]: With dead ends: 26160 [2024-11-07 01:07:25,773 INFO L226 Difference]: Without dead ends: 19506 [2024-11-07 01:07:25,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:25,795 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 5796 mSDsluCounter, 17215 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5816 SdHoareTripleChecker+Valid, 21529 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:25,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5816 Valid, 21529 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 01:07:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19506 states. [2024-11-07 01:07:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19506 to 15053. [2024-11-07 01:07:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 14090 states have (on average 1.5942512420156139) internal successors, (22463), 14124 states have internal predecessors, (22463), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-07 01:07:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24200 transitions. [2024-11-07 01:07:26,454 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24200 transitions. Word has length 189 [2024-11-07 01:07:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:26,454 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24200 transitions. [2024-11-07 01:07:26,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24200 transitions. [2024-11-07 01:07:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:26,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:26,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:26,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:07:26,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:26,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash 842518345, now seen corresponding path program 1 times [2024-11-07 01:07:26,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:26,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906592897] [2024-11-07 01:07:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:26,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,800 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:07:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906592897] [2024-11-07 01:07:26,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906592897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:26,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:26,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:26,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737290448] [2024-11-07 01:07:26,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:26,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:26,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:26,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:26,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:26,802 INFO L87 Difference]: Start difference. First operand 15053 states and 24200 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:29,692 INFO L93 Difference]: Finished difference Result 32698 states and 52633 transitions. [2024-11-07 01:07:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:07:29,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:29,769 INFO L225 Difference]: With dead ends: 32698 [2024-11-07 01:07:29,770 INFO L226 Difference]: Without dead ends: 19787 [2024-11-07 01:07:29,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:07:29,813 INFO L432 NwaCegarLoop]: 4289 mSDtfsCounter, 5194 mSDsluCounter, 16880 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 21169 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:29,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 21169 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:07:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19787 states. [2024-11-07 01:07:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19787 to 15053. [2024-11-07 01:07:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 14090 states have (on average 1.5919091554293825) internal successors, (22430), 14124 states have internal predecessors, (22430), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-07 01:07:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24167 transitions. [2024-11-07 01:07:30,743 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24167 transitions. Word has length 189 [2024-11-07 01:07:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:30,744 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24167 transitions. [2024-11-07 01:07:30,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24167 transitions. [2024-11-07 01:07:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:30,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:30,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:07:30,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1352710521, now seen corresponding path program 1 times [2024-11-07 01:07:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142982157] [2024-11-07 01:07:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:31,059 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:07:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142982157] [2024-11-07 01:07:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142982157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779292488] [2024-11-07 01:07:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:31,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:31,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:31,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:31,061 INFO L87 Difference]: Start difference. First operand 15053 states and 24167 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:35,915 INFO L93 Difference]: Finished difference Result 49005 states and 78262 transitions. [2024-11-07 01:07:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:35,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:36,055 INFO L225 Difference]: With dead ends: 49005 [2024-11-07 01:07:36,055 INFO L226 Difference]: Without dead ends: 36094 [2024-11-07 01:07:36,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:36,096 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5676 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3747 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:36,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 22525 Invalid, 3812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3747 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 01:07:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36094 states. [2024-11-07 01:07:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36094 to 27631. [2024-11-07 01:07:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27631 states, 25740 states have (on average 1.5683760683760684) internal successors, (40370), 25806 states have internal predecessors, (40370), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-07 01:07:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 44033 transitions. [2024-11-07 01:07:37,508 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 44033 transitions. Word has length 189 [2024-11-07 01:07:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:37,508 INFO L471 AbstractCegarLoop]: Abstraction has 27631 states and 44033 transitions. [2024-11-07 01:07:37,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 44033 transitions. [2024-11-07 01:07:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:37,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:37,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:07:37,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:37,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1007882359, now seen corresponding path program 1 times [2024-11-07 01:07:37,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:37,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130870156] [2024-11-07 01:07:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:37,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:37,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:37,809 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:07:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130870156] [2024-11-07 01:07:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130870156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051041965] [2024-11-07 01:07:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:37,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:37,810 INFO L87 Difference]: Start difference. First operand 27631 states and 44033 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:43,806 INFO L93 Difference]: Finished difference Result 94765 states and 151582 transitions. [2024-11-07 01:07:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:43,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2024-11-07 01:07:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:44,098 INFO L225 Difference]: With dead ends: 94765 [2024-11-07 01:07:44,098 INFO L226 Difference]: Without dead ends: 69276 [2024-11-07 01:07:44,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:44,165 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5681 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3729 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5701 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:44,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5701 Valid, 22525 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3729 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 01:07:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69276 states. [2024-11-07 01:07:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69276 to 52848. [2024-11-07 01:07:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52848 states, 49101 states have (on average 1.5547544856520235) internal successors, (76340), 49231 states have internal predecessors, (76340), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-07 01:07:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52848 states to 52848 states and 84341 transitions. [2024-11-07 01:07:47,108 INFO L78 Accepts]: Start accepts. Automaton has 52848 states and 84341 transitions. Word has length 189 [2024-11-07 01:07:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:47,108 INFO L471 AbstractCegarLoop]: Abstraction has 52848 states and 84341 transitions. [2024-11-07 01:07:47,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:07:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 52848 states and 84341 transitions. [2024-11-07 01:07:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:07:47,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:47,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:47,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:07:47,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:47,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -26927545, now seen corresponding path program 1 times [2024-11-07 01:07:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496416732] [2024-11-07 01:07:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:07:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:07:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:07:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:07:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:47,492 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:07:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496416732] [2024-11-07 01:07:47,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496416732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:47,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:47,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001776769] [2024-11-07 01:07:47,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:47,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:47,496 INFO L87 Difference]: Start difference. First operand 52848 states and 84341 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)