./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.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_label49+token_ring.10.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', 'ead4d47009bf2f1ade65f6eacfdab211d65347e20b879f4822b8ceaab9ef42cd'] 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_label49+token_ring.10.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 ead4d47009bf2f1ade65f6eacfdab211d65347e20b879f4822b8ceaab9ef42cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:10:27,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:10:27,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:10:27,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:10:27,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:10:27,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:10:27,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:10:27,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:10:27,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:10:27,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:10:27,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:10:27,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:10:27,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:10:27,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:10:27,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:10:27,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:10:27,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:10:27,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:10:27,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:10:27,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:10:27,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:10:27,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:10:27,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:10:27,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:10:27,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:27,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:10:27,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:10:27,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:10:27,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:10:27,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:10:27,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:10:27,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:10:27,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:10:27,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:10:27,805 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 -> ead4d47009bf2f1ade65f6eacfdab211d65347e20b879f4822b8ceaab9ef42cd [2024-11-07 01:10:28,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:10:28,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:10:28,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:10:28,092 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:10:28,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:10:28,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c [2024-11-07 01:10:29,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:10:30,197 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:10:30,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-2.c [2024-11-07 01:10:30,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46d7f7b40/6626025a13a74027a94716067a4fca76/FLAG53c1d1f94 [2024-11-07 01:10:30,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46d7f7b40/6626025a13a74027a94716067a4fca76 [2024-11-07 01:10:30,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:10:30,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:10:30,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:30,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:10:30,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:10:30,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:30" (1/1) ... [2024-11-07 01:10:30,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ecb49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:30, skipping insertion in model container [2024-11-07 01:10:30,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:30" (1/1) ... [2024-11-07 01:10:30,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:10:31,666 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_label49+token_ring.10.cil-2.c[380593,380606] [2024-11-07 01:10:31,694 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_label49+token_ring.10.cil-2.c[383339,383352] [2024-11-07 01:10:31,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:31,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:10:32,586 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_label49+token_ring.10.cil-2.c[380593,380606] [2024-11-07 01:10:32,592 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_label49+token_ring.10.cil-2.c[383339,383352] [2024-11-07 01:10:32,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:32,687 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:10:32,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32 WrapperNode [2024-11-07 01:10:32,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:32,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:32,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:10:32,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:10:32,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:32,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,259 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-11-07 01:10:33,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:33,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:10:33,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:10:33,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:10:33,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,459 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:10:33,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:10:33,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:10:33,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:10:33,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:10:33,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (1/1) ... [2024-11-07 01:10:33,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:33,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:10:33,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:10:33,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:10:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:10:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:10:33,957 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:10:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:10:33,957 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:10:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:10:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:10:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:10:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:10:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:10:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:10:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:10:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:10:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:10:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:10:33,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:10:34,164 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:10:34,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:10:42,206 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-11-07 01:10:42,207 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:10:42,288 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:10:42,289 INFO L316 CfgBuilder]: Removed 14 assume(true) statements. [2024-11-07 01:10:42,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:42 BoogieIcfgContainer [2024-11-07 01:10:42,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:10:42,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:10:42,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:10:42,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:10:42,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:10:30" (1/3) ... [2024-11-07 01:10:42,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1eceac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:42, skipping insertion in model container [2024-11-07 01:10:42,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:32" (2/3) ... [2024-11-07 01:10:42,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1eceac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:42, skipping insertion in model container [2024-11-07 01:10:42,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:42" (3/3) ... [2024-11-07 01:10:42,302 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.10.cil-2.c [2024-11-07 01:10:42,316 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:10:42,317 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:10:42,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:10:42,456 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;@7aeec50a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:10:42,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:10:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 01:10:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:10:42,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:42,490 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] [2024-11-07 01:10:42,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:42,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2034921809, now seen corresponding path program 1 times [2024-11-07 01:10:42,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:42,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109442857] [2024-11-07 01:10:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:10:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:10:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:10:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:10:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109442857] [2024-11-07 01:10:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109442857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:10:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376181082] [2024-11-07 01:10:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:43,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:10:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:43,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:10:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:10:43,155 INFO L87 Difference]: Start difference. First operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:44,954 INFO L93 Difference]: Finished difference Result 5162 states and 9468 transitions. [2024-11-07 01:10:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:10:44,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 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 156 [2024-11-07 01:10:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:44,991 INFO L225 Difference]: With dead ends: 5162 [2024-11-07 01:10:44,992 INFO L226 Difference]: Without dead ends: 2579 [2024-11-07 01:10:45,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:10:45,009 INFO L432 NwaCegarLoop]: 4337 mSDtfsCounter, 899 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:45,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 16772 Invalid, 931 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:10:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2024-11-07 01:10:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2459. [2024-11-07 01:10:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2427 states have (on average 1.826534816646065) internal successors, (4433), 2429 states have internal predecessors, (4433), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 01:10:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4481 transitions. [2024-11-07 01:10:45,202 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4481 transitions. Word has length 156 [2024-11-07 01:10:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:45,203 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4481 transitions. [2024-11-07 01:10:45,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4481 transitions. [2024-11-07 01:10:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:10:45,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:45,211 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] [2024-11-07 01:10:45,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:10:45,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:45,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1833490989, now seen corresponding path program 1 times [2024-11-07 01:10:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904342995] [2024-11-07 01:10:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:10:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:10:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:10:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:10:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:45,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:45,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904342995] [2024-11-07 01:10:45,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904342995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:45,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194059117] [2024-11-07 01:10:45,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:45,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:45,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:45,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:45,766 INFO L87 Difference]: Start difference. First operand 2459 states and 4481 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:49,335 INFO L93 Difference]: Finished difference Result 3374 states and 5955 transitions. [2024-11-07 01:10:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:49,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:10:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:49,353 INFO L225 Difference]: With dead ends: 3374 [2024-11-07 01:10:49,354 INFO L226 Difference]: Without dead ends: 3054 [2024-11-07 01:10:49,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:49,358 INFO L432 NwaCegarLoop]: 4460 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3167 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22009 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:49,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22009 Invalid, 3229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3167 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 01:10:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2024-11-07 01:10:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2797. [2024-11-07 01:10:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2736 states have (on average 1.7978801169590644) internal successors, (4919), 2740 states have internal predecessors, (4919), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-11-07 01:10:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 5016 transitions. [2024-11-07 01:10:49,464 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 5016 transitions. Word has length 156 [2024-11-07 01:10:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:49,465 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 5016 transitions. [2024-11-07 01:10:49,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 5016 transitions. [2024-11-07 01:10:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:10:49,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:49,471 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] [2024-11-07 01:10:49,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:10:49,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:49,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash 216050539, now seen corresponding path program 1 times [2024-11-07 01:10:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021816667] [2024-11-07 01:10:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:10:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:10:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:10:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:10:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:49,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021816667] [2024-11-07 01:10:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021816667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:49,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:49,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470709455] [2024-11-07 01:10:49,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:49,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:49,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:49,776 INFO L87 Difference]: Start difference. First operand 2797 states and 5016 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:52,611 INFO L93 Difference]: Finished difference Result 4542 states and 7800 transitions. [2024-11-07 01:10:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:52,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:10:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:52,631 INFO L225 Difference]: With dead ends: 4542 [2024-11-07 01:10:52,631 INFO L226 Difference]: Without dead ends: 3886 [2024-11-07 01:10:52,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:52,637 INFO L432 NwaCegarLoop]: 4406 mSDtfsCounter, 5285 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5302 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:52,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5302 Valid, 21880 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 01:10:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2024-11-07 01:10:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3421. [2024-11-07 01:10:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3308 states have (on average 1.7533252720677146) internal successors, (5800), 3314 states have internal predecessors, (5800), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-11-07 01:10:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 5983 transitions. [2024-11-07 01:10:52,767 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 5983 transitions. Word has length 156 [2024-11-07 01:10:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 5983 transitions. [2024-11-07 01:10:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 5983 transitions. [2024-11-07 01:10:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:10:52,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:52,771 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] [2024-11-07 01:10:52,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:10:52,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:52,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 579517037, now seen corresponding path program 1 times [2024-11-07 01:10:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691674120] [2024-11-07 01:10:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:10:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:10:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:10:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:10:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:53,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691674120] [2024-11-07 01:10:53,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691674120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:53,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:53,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744070030] [2024-11-07 01:10:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:53,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:53,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:53,062 INFO L87 Difference]: Start difference. First operand 3421 states and 5983 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:55,860 INFO L93 Difference]: Finished difference Result 6828 states and 11399 transitions. [2024-11-07 01:10:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:10:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:55,885 INFO L225 Difference]: With dead ends: 6828 [2024-11-07 01:10:55,885 INFO L226 Difference]: Without dead ends: 5548 [2024-11-07 01:10:55,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:55,893 INFO L432 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:55,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:10:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2024-11-07 01:10:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4671. [2024-11-07 01:10:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 4454 states have (on average 1.698248765154917) internal successors, (7564), 4464 states have internal predecessors, (7564), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-11-07 01:10:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7925 transitions. [2024-11-07 01:10:56,227 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 7925 transitions. Word has length 156 [2024-11-07 01:10:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:56,228 INFO L471 AbstractCegarLoop]: Abstraction has 4671 states and 7925 transitions. [2024-11-07 01:10:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 7925 transitions. [2024-11-07 01:10:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:10:56,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:56,233 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] [2024-11-07 01:10:56,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:10:56,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:56,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash 868336427, now seen corresponding path program 1 times [2024-11-07 01:10:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:56,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639559718] [2024-11-07 01:10:56,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:56,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:10:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:10:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:10:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:10:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639559718] [2024-11-07 01:10:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639559718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063708827] [2024-11-07 01:10:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:56,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:56,527 INFO L87 Difference]: Start difference. First operand 4671 states and 7925 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:59,432 INFO L93 Difference]: Finished difference Result 11398 states and 18611 transitions. [2024-11-07 01:10:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:59,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:10:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:59,473 INFO L225 Difference]: With dead ends: 11398 [2024-11-07 01:10:59,473 INFO L226 Difference]: Without dead ends: 8868 [2024-11-07 01:10:59,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:59,484 INFO L432 NwaCegarLoop]: 4456 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22005 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:59,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22005 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:10:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-11-07 01:10:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 7177. [2024-11-07 01:10:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 6752 states have (on average 1.643957345971564) internal successors, (11100), 6770 states have internal predecessors, (11100), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-11-07 01:10:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 11835 transitions. [2024-11-07 01:10:59,783 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 11835 transitions. Word has length 156 [2024-11-07 01:10:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:59,784 INFO L471 AbstractCegarLoop]: Abstraction has 7177 states and 11835 transitions. [2024-11-07 01:10:59,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 11835 transitions. [2024-11-07 01:10:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:10:59,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:59,790 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] [2024-11-07 01:10:59,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:10:59,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 323463853, now seen corresponding path program 1 times [2024-11-07 01:10:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967999001] [2024-11-07 01:10:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:10:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:11:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:11:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:11:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967999001] [2024-11-07 01:11:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967999001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258695058] [2024-11-07 01:11:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:00,050 INFO L87 Difference]: Start difference. First operand 7177 states and 11835 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:03,293 INFO L93 Difference]: Finished difference Result 20536 states and 33091 transitions. [2024-11-07 01:11:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:11:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:03,369 INFO L225 Difference]: With dead ends: 20536 [2024-11-07 01:11:03,370 INFO L226 Difference]: Without dead ends: 15500 [2024-11-07 01:11:03,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:03,394 INFO L432 NwaCegarLoop]: 4459 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22008 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:03,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22008 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:11:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15500 states. [2024-11-07 01:11:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15500 to 12203. [2024-11-07 01:11:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12203 states, 11362 states have (on average 1.6011265622249604) internal successors, (18192), 11396 states have internal predecessors, (18192), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-11-07 01:11:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 19729 transitions. [2024-11-07 01:11:03,990 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 19729 transitions. Word has length 156 [2024-11-07 01:11:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:03,991 INFO L471 AbstractCegarLoop]: Abstraction has 12203 states and 19729 transitions. [2024-11-07 01:11:03,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 19729 transitions. [2024-11-07 01:11:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:11:04,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:04,001 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] [2024-11-07 01:11:04,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:11:04,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:04,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash 998623979, now seen corresponding path program 1 times [2024-11-07 01:11:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:04,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915210361] [2024-11-07 01:11:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:11:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:11:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:11:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:11:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:04,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:04,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915210361] [2024-11-07 01:11:04,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915210361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:04,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775084030] [2024-11-07 01:11:04,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:04,243 INFO L87 Difference]: Start difference. First operand 12203 states and 19729 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:07,873 INFO L93 Difference]: Finished difference Result 38810 states and 62239 transitions. [2024-11-07 01:11:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:11:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:07,987 INFO L225 Difference]: With dead ends: 38810 [2024-11-07 01:11:07,987 INFO L226 Difference]: Without dead ends: 28748 [2024-11-07 01:11:08,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:08,027 INFO L432 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:08,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:11:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28748 states. [2024-11-07 01:11:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28748 to 22285. [2024-11-07 01:11:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5728701727149232) internal successors, (32420), 20678 states have internal predecessors, (32420), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-07 01:11:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35723 transitions. [2024-11-07 01:11:09,026 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35723 transitions. Word has length 156 [2024-11-07 01:11:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:09,026 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35723 transitions. [2024-11-07 01:11:09,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35723 transitions. [2024-11-07 01:11:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:11:09,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:09,040 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] [2024-11-07 01:11:09,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:11:09,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:09,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash 50572013, now seen corresponding path program 1 times [2024-11-07 01:11:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265010766] [2024-11-07 01:11:09,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:11:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:11:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:09,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:11:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:11:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:09,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265010766] [2024-11-07 01:11:09,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265010766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:09,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:09,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980669920] [2024-11-07 01:11:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:09,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:09,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:09,286 INFO L87 Difference]: Start difference. First operand 22285 states and 35723 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:11,393 INFO L93 Difference]: Finished difference Result 49349 states and 79788 transitions. [2024-11-07 01:11:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:11:11,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:11:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:11,518 INFO L225 Difference]: With dead ends: 49349 [2024-11-07 01:11:11,518 INFO L226 Difference]: Without dead ends: 29203 [2024-11-07 01:11:11,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:11:11,583 INFO L432 NwaCegarLoop]: 4227 mSDtfsCounter, 5082 mSDsluCounter, 12542 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 16769 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:11,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 16769 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:11:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29203 states. [2024-11-07 01:11:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29203 to 22285. [2024-11-07 01:11:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5697166699010285) internal successors, (32355), 20678 states have internal predecessors, (32355), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-07 01:11:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35658 transitions. [2024-11-07 01:11:12,898 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35658 transitions. Word has length 156 [2024-11-07 01:11:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:12,898 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35658 transitions. [2024-11-07 01:11:12,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35658 transitions. [2024-11-07 01:11:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:11:12,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:12,912 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] [2024-11-07 01:11:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:11:12,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash -534199637, now seen corresponding path program 1 times [2024-11-07 01:11:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921712244] [2024-11-07 01:11:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:11:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:11:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:11:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:11:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921712244] [2024-11-07 01:11:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921712244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771058166] [2024-11-07 01:11:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:13,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:13,152 INFO L87 Difference]: Start difference. First operand 22285 states and 35658 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:17,149 INFO L93 Difference]: Finished difference Result 75229 states and 120559 transitions. [2024-11-07 01:11:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:11:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:17,344 INFO L225 Difference]: With dead ends: 75229 [2024-11-07 01:11:17,344 INFO L226 Difference]: Without dead ends: 55085 [2024-11-07 01:11:17,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:17,418 INFO L432 NwaCegarLoop]: 4457 mSDtfsCounter, 5276 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5293 SdHoareTripleChecker+Valid, 22006 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:17,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5293 Valid, 22006 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:11:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55085 states. [2024-11-07 01:11:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55085 to 42638. [2024-11-07 01:11:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42638 states, 39301 states have (on average 1.5528866949950384) internal successors, (61030), 39431 states have internal predecessors, (61030), 2439 states have call successors, (2439), 768 states have call predecessors, (2439), 896 states have return successors, (4882), 2566 states have call predecessors, (4882), 2439 states have call successors, (4882) [2024-11-07 01:11:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42638 states to 42638 states and 68351 transitions. [2024-11-07 01:11:19,579 INFO L78 Accepts]: Start accepts. Automaton has 42638 states and 68351 transitions. Word has length 156 [2024-11-07 01:11:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:19,579 INFO L471 AbstractCegarLoop]: Abstraction has 42638 states and 68351 transitions. [2024-11-07 01:11:19,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 42638 states and 68351 transitions. [2024-11-07 01:11:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:11:19,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:19,606 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] [2024-11-07 01:11:19,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:11:19,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:19,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -963857943, now seen corresponding path program 1 times [2024-11-07 01:11:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856314806] [2024-11-07 01:11:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:11:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:11:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:19,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:11:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:19,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:11:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:19,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:19,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856314806] [2024-11-07 01:11:19,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856314806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:19,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:19,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584962776] [2024-11-07 01:11:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:19,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:19,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:19,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:19,882 INFO L87 Difference]: Start difference. First operand 42638 states and 68351 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:25,820 INFO L93 Difference]: Finished difference Result 148320 states and 239808 transitions. [2024-11-07 01:11:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:25,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2024-11-07 01:11:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:26,244 INFO L225 Difference]: With dead ends: 148320 [2024-11-07 01:11:26,245 INFO L226 Difference]: Without dead ends: 107823 [2024-11-07 01:11:26,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:26,387 INFO L432 NwaCegarLoop]: 4407 mSDtfsCounter, 5302 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5319 SdHoareTripleChecker+Valid, 21881 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:26,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5319 Valid, 21881 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:11:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107823 states. [2024-11-07 01:11:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107823 to 83472. [2024-11-07 01:11:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83472 states, 76807 states have (on average 1.5437655422031846) internal successors, (118572), 77065 states have internal predecessors, (118572), 4871 states have call successors, (4871), 1536 states have call predecessors, (4871), 1792 states have return successors, (11944), 5126 states have call predecessors, (11944), 4871 states have call successors, (11944) [2024-11-07 01:11:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83472 states to 83472 states and 135387 transitions. [2024-11-07 01:11:30,828 INFO L78 Accepts]: Start accepts. Automaton has 83472 states and 135387 transitions. Word has length 156 [2024-11-07 01:11:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:30,829 INFO L471 AbstractCegarLoop]: Abstraction has 83472 states and 135387 transitions. [2024-11-07 01:11:30,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 83472 states and 135387 transitions. [2024-11-07 01:11:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 01:11:30,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:30,881 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] [2024-11-07 01:11:30,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:11:30,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:30,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1670454549, now seen corresponding path program 1 times [2024-11-07 01:11:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986790648] [2024-11-07 01:11:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 01:11:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:11:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 01:11:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:31,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 01:11:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:11:31,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:31,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986790648] [2024-11-07 01:11:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986790648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:31,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:31,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570596616] [2024-11-07 01:11:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:31,151 INFO L87 Difference]: Start difference. First operand 83472 states and 135387 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 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)