./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+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_label42+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', '216404335c43b82447a03ad9d88ac8bc18e7528b04f40169d87fb26955d8753c'] 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_label42+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 216404335c43b82447a03ad9d88ac8bc18e7528b04f40169d87fb26955d8753c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:58:38,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:58:38,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:58:38,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:58:38,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:58:38,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:58:38,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:58:38,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:58:38,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:58:38,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:58:38,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:58:38,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:58:38,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:58:38,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:58:38,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:58:38,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:58:38,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:58:38,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:58:38,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:58:38,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:58:38,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:58:38,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:58:38,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:58:38,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:58:38,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:58:38,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:58:38,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:58:38,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:58:38,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:58:38,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:58:38,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:58:38,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:58:38,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:58:38,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:58:38,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:58:38,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:58:38,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:58:38,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:58:38,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:58:38,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:58:38,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:58:38,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:58:38,819 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 -> 216404335c43b82447a03ad9d88ac8bc18e7528b04f40169d87fb26955d8753c [2024-11-07 00:58:39,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:58:39,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:58:39,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:58:39,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:58:39,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:58:39,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.13.cil-2.c [2024-11-07 00:58:40,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:58:41,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:58:41,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.13.cil-2.c [2024-11-07 00:58:41,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7aa3abe31/0aac55a59f494bfc87bd2490f5df25b2/FLAG03a3eec9e [2024-11-07 00:58:41,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7aa3abe31/0aac55a59f494bfc87bd2490f5df25b2 [2024-11-07 00:58:41,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:58:41,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:58:41,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:58:41,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:58:41,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:58:41,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:58:41" (1/1) ... [2024-11-07 00:58:41,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1197867e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:41, skipping insertion in model container [2024-11-07 00:58:41,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:58:41" (1/1) ... [2024-11-07 00:58:41,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:58:42,721 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_label42+token_ring.13.cil-2.c[378560,378573] [2024-11-07 00:58:42,756 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_label42+token_ring.13.cil-2.c[383339,383352] [2024-11-07 00:58:43,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:58:43,046 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:58:43,756 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_label42+token_ring.13.cil-2.c[378560,378573] [2024-11-07 00:58:43,764 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_label42+token_ring.13.cil-2.c[383339,383352] [2024-11-07 00:58:43,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:58:43,868 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:58:43,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43 WrapperNode [2024-11-07 00:58:43,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:58:43,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:58:43,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:58:43,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:58:43,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:43,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,507 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-11-07 00:58:44,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:58:44,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:58:44,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:58:44,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:58:44,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,678 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 00:58:44,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:44,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:45,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:45,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:58:45,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:58:45,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:58:45,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:58:45,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (1/1) ... [2024-11-07 00:58:45,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:58:45,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:58:45,122 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 00:58:45,124 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 00:58:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:58:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:58:45,146 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:58:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:58:45,146 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:58:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:58:45,146 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:58:45,147 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:58:45,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:58:45,147 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:58:45,147 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:58:45,147 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:58:45,147 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:58:45,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:58:45,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:58:45,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:58:45,357 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:58:45,359 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:58:53,438 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-11-07 00:58:53,439 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:58:53,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:58:53,506 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-07 00:58:53,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:53 BoogieIcfgContainer [2024-11-07 00:58:53,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:58:53,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:58:53,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:58:53,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:58:53,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:58:41" (1/3) ... [2024-11-07 00:58:53,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a5698e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:53, skipping insertion in model container [2024-11-07 00:58:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:43" (2/3) ... [2024-11-07 00:58:53,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a5698e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:53, skipping insertion in model container [2024-11-07 00:58:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:53" (3/3) ... [2024-11-07 00:58:53,514 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.13.cil-2.c [2024-11-07 00:58:53,525 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:58:53,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:58:53,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:58:53,647 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;@608cf816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:58:53,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:58:53,661 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 00:58:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:58:53,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:53,679 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 00:58:53,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:53,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash -481144573, now seen corresponding path program 1 times [2024-11-07 00:58:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333022302] [2024-11-07 00:58:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:53,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:58:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:58:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:58:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:58:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:54,372 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 00:58:54,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333022302] [2024-11-07 00:58:54,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333022302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:54,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:54,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:58:54,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476735457] [2024-11-07 00:58:54,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:54,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:58:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:54,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:58:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:58:54,411 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 00:58:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:56,852 INFO L93 Difference]: Finished difference Result 5353 states and 9793 transitions. [2024-11-07 00:58:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:58:56,855 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 00:58:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:56,883 INFO L225 Difference]: With dead ends: 5353 [2024-11-07 00:58:56,884 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 00:58:56,897 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 00:58:56,901 INFO L432 NwaCegarLoop]: 4406 mSDtfsCounter, 1125 mSDsluCounter, 12519 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:56,902 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.8s Time] [2024-11-07 00:58:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 00:58:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 00:58:57,056 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 00:58:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4607 transitions. [2024-11-07 00:58:57,077 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4607 transitions. Word has length 189 [2024-11-07 00:58:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:57,077 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4607 transitions. [2024-11-07 00:58:57,077 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 00:58:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4607 transitions. [2024-11-07 00:58:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:58:57,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:57,088 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 00:58:57,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:58:57,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:57,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1484842181, now seen corresponding path program 1 times [2024-11-07 00:58:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:57,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587710573] [2024-11-07 00:58:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:57,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:58:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:58:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:58:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:58:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:57,436 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 00:58:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587710573] [2024-11-07 00:58:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587710573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:57,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:58:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395758188] [2024-11-07 00:58:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:57,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:58:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:57,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:58:57,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:58:57,440 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 00:58:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:59,461 INFO L93 Difference]: Finished difference Result 3089 states and 5491 transitions. [2024-11-07 00:58:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:58:59,462 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 00:58:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:59,476 INFO L225 Difference]: With dead ends: 3089 [2024-11-07 00:58:59,477 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 00:58:59,480 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 00:58:59,480 INFO L432 NwaCegarLoop]: 4336 mSDtfsCounter, 1111 mSDsluCounter, 12316 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:59,481 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.5s Time] [2024-11-07 00:58:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 00:58:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 00:58:59,547 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 00:58:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4606 transitions. [2024-11-07 00:58:59,559 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4606 transitions. Word has length 189 [2024-11-07 00:58:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:59,559 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4606 transitions. [2024-11-07 00:58:59,560 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 00:58:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4606 transitions. [2024-11-07 00:58:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:58:59,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:59,563 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 00:58:59,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:58:59,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:59,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1307026809, now seen corresponding path program 1 times [2024-11-07 00:58:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500123749] [2024-11-07 00:58:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:58:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:58:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:58:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:58:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,906 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 00:58:59,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:59,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500123749] [2024-11-07 00:58:59,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500123749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:59,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:59,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:58:59,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282312958] [2024-11-07 00:58:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:59,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:58:59,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:58:59,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:58:59,909 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 00:59:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:03,072 INFO L93 Difference]: Finished difference Result 3653 states and 6401 transitions. [2024-11-07 00:59:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:59:03,073 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 00:59:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:03,086 INFO L225 Difference]: With dead ends: 3653 [2024-11-07 00:59:03,086 INFO L226 Difference]: Without dead ends: 3258 [2024-11-07 00:59:03,088 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 00:59:03,089 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 00:59:03,090 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 00:59:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2024-11-07 00:59:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2953. [2024-11-07 00:59:03,180 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 00:59:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5264 transitions. [2024-11-07 00:59:03,189 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 5264 transitions. Word has length 189 [2024-11-07 00:59:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:03,189 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 5264 transitions. [2024-11-07 00:59:03,189 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 00:59:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 5264 transitions. [2024-11-07 00:59:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:03,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:03,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:59:03,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:59:03,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:03,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:03,193 INFO L85 PathProgramCache]: Analyzing trace with hash 711601675, now seen corresponding path program 1 times [2024-11-07 00:59:03,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:03,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721273516] [2024-11-07 00:59:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:03,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:03,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:03,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:03,549 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 00:59:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721273516] [2024-11-07 00:59:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721273516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:03,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257547467] [2024-11-07 00:59:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:03,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:03,552 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 00:59:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:07,514 INFO L93 Difference]: Finished difference Result 4659 states and 8012 transitions. [2024-11-07 00:59:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:07,516 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 00:59:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:07,533 INFO L225 Difference]: With dead ends: 4659 [2024-11-07 00:59:07,533 INFO L226 Difference]: Without dead ends: 3848 [2024-11-07 00:59:07,537 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 00:59:07,538 INFO L432 NwaCegarLoop]: 4572 mSDtfsCounter, 5693 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:07,540 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.9s Time] [2024-11-07 00:59:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2024-11-07 00:59:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3340. [2024-11-07 00:59:07,646 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 00:59:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 5863 transitions. [2024-11-07 00:59:07,660 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 5863 transitions. Word has length 189 [2024-11-07 00:59:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:07,661 INFO L471 AbstractCegarLoop]: Abstraction has 3340 states and 5863 transitions. [2024-11-07 00:59:07,661 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 00:59:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 5863 transitions. [2024-11-07 00:59:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:07,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:07,664 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 00:59:07,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:59:07,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:07,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1013006647, now seen corresponding path program 1 times [2024-11-07 00:59:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:07,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702434987] [2024-11-07 00:59:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:08,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:08,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:08,158 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 00:59:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702434987] [2024-11-07 00:59:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702434987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:08,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2757664] [2024-11-07 00:59:08,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:08,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:08,164 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 00:59:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:12,052 INFO L93 Difference]: Finished difference Result 6142 states and 10367 transitions. [2024-11-07 00:59:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:12,053 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 00:59:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:12,074 INFO L225 Difference]: With dead ends: 6142 [2024-11-07 00:59:12,074 INFO L226 Difference]: Without dead ends: 4944 [2024-11-07 00:59:12,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:59:12,082 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5687 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5707 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:12,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5707 Valid, 22525 Invalid, 3889 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3824 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:59:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2024-11-07 00:59:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4118. [2024-11-07 00:59:12,219 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 00:59:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 7072 transitions. [2024-11-07 00:59:12,230 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 7072 transitions. Word has length 189 [2024-11-07 00:59:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:12,230 INFO L471 AbstractCegarLoop]: Abstraction has 4118 states and 7072 transitions. [2024-11-07 00:59:12,231 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 00:59:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 7072 transitions. [2024-11-07 00:59:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:12,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:12,235 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 00:59:12,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:59:12,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:12,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:12,236 INFO L85 PathProgramCache]: Analyzing trace with hash -442734841, now seen corresponding path program 1 times [2024-11-07 00:59:12,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:12,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572304620] [2024-11-07 00:59:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:12,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:12,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:12,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:12,546 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 00:59:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572304620] [2024-11-07 00:59:12,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572304620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:12,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:12,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644049926] [2024-11-07 00:59:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:12,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:12,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:12,549 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 00:59:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:16,803 INFO L93 Difference]: Finished difference Result 9002 states and 14876 transitions. [2024-11-07 00:59:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:16,804 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 00:59:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:16,830 INFO L225 Difference]: With dead ends: 9002 [2024-11-07 00:59:16,830 INFO L226 Difference]: Without dead ends: 7026 [2024-11-07 00:59:16,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:59:16,839 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5686 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3811 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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 00:59:16,840 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 00:59:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2024-11-07 00:59:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 5675. [2024-11-07 00:59:17,056 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 00:59:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5675 states to 5675 states and 9496 transitions. [2024-11-07 00:59:17,070 INFO L78 Accepts]: Start accepts. Automaton has 5675 states and 9496 transitions. Word has length 189 [2024-11-07 00:59:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:17,070 INFO L471 AbstractCegarLoop]: Abstraction has 5675 states and 9496 transitions. [2024-11-07 00:59:17,071 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 00:59:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5675 states and 9496 transitions. [2024-11-07 00:59:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:17,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:17,076 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 00:59:17,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:59:17,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:17,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 961134345, now seen corresponding path program 1 times [2024-11-07 00:59:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901803548] [2024-11-07 00:59:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:17,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:17,558 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 00:59:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901803548] [2024-11-07 00:59:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901803548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:17,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:17,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582604312] [2024-11-07 00:59:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:17,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:17,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:17,564 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 00:59:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:21,612 INFO L93 Difference]: Finished difference Result 14721 states and 23910 transitions. [2024-11-07 00:59:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:21,613 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 00:59:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:21,656 INFO L225 Difference]: With dead ends: 14721 [2024-11-07 00:59:21,657 INFO L226 Difference]: Without dead ends: 11188 [2024-11-07 00:59:21,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:59:21,671 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5685 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5705 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:21,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5705 Valid, 22525 Invalid, 3863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:59:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11188 states. [2024-11-07 00:59:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11188 to 8796. [2024-11-07 00:59:22,269 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 00:59:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8796 states to 8796 states and 14372 transitions. [2024-11-07 00:59:22,325 INFO L78 Accepts]: Start accepts. Automaton has 8796 states and 14372 transitions. Word has length 189 [2024-11-07 00:59:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 8796 states and 14372 transitions. [2024-11-07 00:59:22,326 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 00:59:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8796 states and 14372 transitions. [2024-11-07 00:59:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:22,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:22,337 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 00:59:22,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:59:22,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:22,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 175136455, now seen corresponding path program 1 times [2024-11-07 00:59:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:22,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803271306] [2024-11-07 00:59:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:22,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:22,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:22,719 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 00:59:22,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:22,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803271306] [2024-11-07 00:59:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803271306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:22,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:22,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:22,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879852304] [2024-11-07 00:59:22,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:22,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:22,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:22,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:22,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:22,721 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 00:59:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:26,679 INFO L93 Difference]: Finished difference Result 26160 states and 42040 transitions. [2024-11-07 00:59:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:26,679 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 00:59:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:26,748 INFO L225 Difference]: With dead ends: 26160 [2024-11-07 00:59:26,749 INFO L226 Difference]: Without dead ends: 19506 [2024-11-07 00:59:26,772 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 00:59:26,773 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 5796 mSDsluCounter, 17215 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:26,773 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.5s Time] [2024-11-07 00:59:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19506 states. [2024-11-07 00:59:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19506 to 15053. [2024-11-07 00:59:27,639 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 00:59:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24200 transitions. [2024-11-07 00:59:27,734 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24200 transitions. Word has length 189 [2024-11-07 00:59:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24200 transitions. [2024-11-07 00:59:27,735 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 00:59:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24200 transitions. [2024-11-07 00:59:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:27,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:27,757 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 00:59:27,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:59:27,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:27,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash 842518345, now seen corresponding path program 1 times [2024-11-07 00:59:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24998065] [2024-11-07 00:59:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,195 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 00:59:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:28,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24998065] [2024-11-07 00:59:28,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24998065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:28,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:28,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940565354] [2024-11-07 00:59:28,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:28,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:28,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:28,197 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 00:59:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:31,060 INFO L93 Difference]: Finished difference Result 32698 states and 52633 transitions. [2024-11-07 00:59:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:59:31,061 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 00:59:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:31,143 INFO L225 Difference]: With dead ends: 32698 [2024-11-07 00:59:31,143 INFO L226 Difference]: Without dead ends: 19787 [2024-11-07 00:59:31,187 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 00:59:31,188 INFO L432 NwaCegarLoop]: 4289 mSDtfsCounter, 5194 mSDsluCounter, 16880 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 21169 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:31,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 21169 Invalid, 2014 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:59:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19787 states. [2024-11-07 00:59:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19787 to 15053. [2024-11-07 00:59:31,985 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 00:59:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24167 transitions. [2024-11-07 00:59:32,033 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24167 transitions. Word has length 189 [2024-11-07 00:59:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:32,034 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24167 transitions. [2024-11-07 00:59:32,034 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 00:59:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24167 transitions. [2024-11-07 00:59:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:32,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:32,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:59:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:59:32,046 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:32,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1352710521, now seen corresponding path program 1 times [2024-11-07 00:59:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:32,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205527119] [2024-11-07 00:59:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:59:32,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:32,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205527119] [2024-11-07 00:59:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205527119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:32,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711274912] [2024-11-07 00:59:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:32,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:32,339 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 00:59:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:37,054 INFO L93 Difference]: Finished difference Result 49005 states and 78262 transitions. [2024-11-07 00:59:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:37,055 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 00:59:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:37,173 INFO L225 Difference]: With dead ends: 49005 [2024-11-07 00:59:37,173 INFO L226 Difference]: Without dead ends: 36094 [2024-11-07 00:59:37,214 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 00:59:37,215 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5676 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3747 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:37,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 22525 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3747 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:59:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36094 states. [2024-11-07 00:59:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36094 to 27631. [2024-11-07 00:59:38,908 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 00:59:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 44033 transitions. [2024-11-07 00:59:39,113 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 44033 transitions. Word has length 189 [2024-11-07 00:59:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:39,114 INFO L471 AbstractCegarLoop]: Abstraction has 27631 states and 44033 transitions. [2024-11-07 00:59:39,114 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 00:59:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 44033 transitions. [2024-11-07 00:59:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:39,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:39,129 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 00:59:39,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:59:39,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:39,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1007882359, now seen corresponding path program 1 times [2024-11-07 00:59:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:39,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691404837] [2024-11-07 00:59:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:39,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:39,422 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 00:59:39,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:39,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691404837] [2024-11-07 00:59:39,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691404837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:39,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:39,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:39,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980953571] [2024-11-07 00:59:39,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:39,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:39,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:39,424 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 00:59:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:45,534 INFO L93 Difference]: Finished difference Result 94765 states and 151582 transitions. [2024-11-07 00:59:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:45,535 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 00:59:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:45,858 INFO L225 Difference]: With dead ends: 94765 [2024-11-07 00:59:45,858 INFO L226 Difference]: Without dead ends: 69276 [2024-11-07 00:59:45,973 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 00:59:45,973 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5681 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3729 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5701 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:45,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5701 Valid, 22525 Invalid, 3794 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3729 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:59:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69276 states. [2024-11-07 00:59:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69276 to 52848. [2024-11-07 00:59:48,513 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 00:59:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52848 states to 52848 states and 84341 transitions. [2024-11-07 00:59:48,650 INFO L78 Accepts]: Start accepts. Automaton has 52848 states and 84341 transitions. Word has length 189 [2024-11-07 00:59:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:48,651 INFO L471 AbstractCegarLoop]: Abstraction has 52848 states and 84341 transitions. [2024-11-07 00:59:48,651 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 00:59:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52848 states and 84341 transitions. [2024-11-07 00:59:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 00:59:48,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:48,675 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 00:59:48,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:59:48,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:48,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -26927545, now seen corresponding path program 1 times [2024-11-07 00:59:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:48,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919281232] [2024-11-07 00:59:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 00:59:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:59:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:59:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 00:59:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,933 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 00:59:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919281232] [2024-11-07 00:59:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919281232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:48,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837426018] [2024-11-07 00:59:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:48,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:48,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:48,937 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)