./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.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/systemc/pc_sfifo_2.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', '5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de'] 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/systemc/pc_sfifo_2.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 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:57:08,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:57:08,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:57:08,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:57:08,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:57:08,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:57:08,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:57:08,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:57:08,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:57:08,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:57:08,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:57:08,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:57:08,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:57:08,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:57:08,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:57:08,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:57:08,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:57:08,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:57:08,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:57:08,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:57:08,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:57:08,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:57:08,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:57:08,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:08,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:57:08,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:57:08,951 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 -> 5adc3402a12b42bc2aef7c382784898827eb467d1d3955bed162b3bd231708de [2024-11-06 23:57:09,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:57:09,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:57:09,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:57:09,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:57:09,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:57:09,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2024-11-06 23:57:10,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:57:10,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:57:10,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2024-11-06 23:57:10,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a238af17/486a48e2c9e8482eb11f485e0893a657/FLAGb5ff36278 [2024-11-06 23:57:10,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a238af17/486a48e2c9e8482eb11f485e0893a657 [2024-11-06 23:57:10,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:57:10,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:57:10,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:10,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:57:10,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:57:10,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:10,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca0284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10, skipping insertion in model container [2024-11-06 23:57:10,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:10,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:57:10,914 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/systemc/pc_sfifo_2.cil-2.c[643,656] [2024-11-06 23:57:10,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:10,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:57:10,961 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/systemc/pc_sfifo_2.cil-2.c[643,656] [2024-11-06 23:57:10,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:10,988 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:57:10,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10 WrapperNode [2024-11-06 23:57:10,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:10,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:10,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:57:10,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:57:10,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:10,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,016 INFO L138 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 190 [2024-11-06 23:57:11,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:11,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:57:11,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:57:11,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:57:11,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,038 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-06 23:57:11,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:57:11,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:57:11,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:57:11,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:57:11,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (1/1) ... [2024-11-06 23:57:11,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:11,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:57:11,082 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-06 23:57:11,086 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-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-06 23:57:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-06 23:57:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-06 23:57:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-06 23:57:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-06 23:57:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-06 23:57:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:57:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-06 23:57:11,101 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-06 23:57:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:57:11,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:57:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-06 23:57:11,101 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-06 23:57:11,153 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:57:11,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:57:11,325 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-06 23:57:11,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:57:11,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:57:11,338 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 23:57:11,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:11 BoogieIcfgContainer [2024-11-06 23:57:11,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:57:11,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:57:11,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:57:11,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:57:11,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:57:10" (1/3) ... [2024-11-06 23:57:11,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a158296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:11, skipping insertion in model container [2024-11-06 23:57:11,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:10" (2/3) ... [2024-11-06 23:57:11,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a158296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:11, skipping insertion in model container [2024-11-06 23:57:11,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:11" (3/3) ... [2024-11-06 23:57:11,346 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2024-11-06 23:57:11,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:57:11,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:57:11,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:57:11,408 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;@7af98bd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:57:11,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:57:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 23:57:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:11,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:11,416 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] [2024-11-06 23:57:11,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2024-11-06 23:57:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255193640] [2024-11-06 23:57:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:57:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:57:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:57:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:57:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:57:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:57:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:11,682 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-06 23:57:11,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255193640] [2024-11-06 23:57:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255193640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:11,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:57:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489406903] [2024-11-06 23:57:11,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:11,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:57:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:57:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:57:11,709 INFO L87 Difference]: Start difference. First operand has 104 states, 79 states have (on average 1.518987341772152) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:12,004 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2024-11-06 23:57:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:57:12,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-11-06 23:57:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:12,010 INFO L225 Difference]: With dead ends: 217 [2024-11-06 23:57:12,010 INFO L226 Difference]: Without dead ends: 116 [2024-11-06 23:57:12,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:57:12,017 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 214 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:12,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 240 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:57:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-06 23:57:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2024-11-06 23:57:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-06 23:57:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-11-06 23:57:12,054 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2024-11-06 23:57:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:12,055 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-11-06 23:57:12,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-11-06 23:57:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:12,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:12,060 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] [2024-11-06 23:57:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:57:12,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2024-11-06 23:57:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411046391] [2024-11-06 23:57:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:57:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:57:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:57:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:57:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:57:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:57:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:57:12,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411046391] [2024-11-06 23:57:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411046391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:12,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:12,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:57:12,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669431789] [2024-11-06 23:57:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:12,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:57:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:57:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:57:12,250 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:12,718 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2024-11-06 23:57:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:57:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-11-06 23:57:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:12,721 INFO L225 Difference]: With dead ends: 323 [2024-11-06 23:57:12,721 INFO L226 Difference]: Without dead ends: 234 [2024-11-06 23:57:12,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:57:12,722 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 322 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:12,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 346 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:57:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-06 23:57:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2024-11-06 23:57:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 156 states have internal predecessors, (209), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-06 23:57:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2024-11-06 23:57:12,760 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2024-11-06 23:57:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:12,761 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2024-11-06 23:57:12,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2024-11-06 23:57:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:12,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:12,763 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] [2024-11-06 23:57:12,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:57:12,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2024-11-06 23:57:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773864558] [2024-11-06 23:57:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:57:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:57:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:57:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:57:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:57:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:57:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:57:12,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773864558] [2024-11-06 23:57:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773864558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:57:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798988741] [2024-11-06 23:57:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:12,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:57:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:57:12,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:57:12,933 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:13,474 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2024-11-06 23:57:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 23:57:13,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-11-06 23:57:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:13,478 INFO L225 Difference]: With dead ends: 543 [2024-11-06 23:57:13,478 INFO L226 Difference]: Without dead ends: 365 [2024-11-06 23:57:13,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-06 23:57:13,482 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 369 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:13,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 671 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:57:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-06 23:57:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2024-11-06 23:57:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 234 states have internal predecessors, (312), 37 states have call successors, (37), 22 states have call predecessors, (37), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2024-11-06 23:57:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2024-11-06 23:57:13,511 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2024-11-06 23:57:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:13,512 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2024-11-06 23:57:13,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2024-11-06 23:57:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:13,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:13,515 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] [2024-11-06 23:57:13,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:57:13,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:13,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2024-11-06 23:57:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:13,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56464538] [2024-11-06 23:57:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:57:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:57:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:57:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:57:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:57:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:57:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:13,633 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-06 23:57:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56464538] [2024-11-06 23:57:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56464538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:13,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 23:57:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836185491] [2024-11-06 23:57:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:13,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 23:57:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 23:57:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:57:13,634 INFO L87 Difference]: Start difference. First operand 290 states and 396 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:57:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:13,959 INFO L93 Difference]: Finished difference Result 590 states and 808 transitions. [2024-11-06 23:57:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:57:13,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-06 23:57:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:13,961 INFO L225 Difference]: With dead ends: 590 [2024-11-06 23:57:13,961 INFO L226 Difference]: Without dead ends: 322 [2024-11-06 23:57:13,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-06 23:57:13,963 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 112 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:13,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 494 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:57:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-06 23:57:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 295. [2024-11-06 23:57:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 238 states have internal predecessors, (314), 37 states have call successors, (37), 22 states have call predecessors, (37), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2024-11-06 23:57:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2024-11-06 23:57:13,993 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2024-11-06 23:57:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:13,993 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2024-11-06 23:57:13,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:57:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2024-11-06 23:57:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:13,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:13,995 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] [2024-11-06 23:57:13,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:57:13,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2024-11-06 23:57:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622176835] [2024-11-06 23:57:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:57:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:57:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:57:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:57:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:57:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:57:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:14,141 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-06 23:57:14,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:14,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622176835] [2024-11-06 23:57:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622176835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:14,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 23:57:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895397201] [2024-11-06 23:57:14,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:14,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 23:57:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 23:57:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:57:14,142 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 23:57:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:15,201 INFO L93 Difference]: Finished difference Result 1963 states and 2677 transitions. [2024-11-06 23:57:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-06 23:57:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-11-06 23:57:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:15,211 INFO L225 Difference]: With dead ends: 1963 [2024-11-06 23:57:15,211 INFO L226 Difference]: Without dead ends: 1690 [2024-11-06 23:57:15,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-06 23:57:15,213 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1116 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:15,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 791 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:57:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2024-11-06 23:57:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1432. [2024-11-06 23:57:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1128 states have (on average 1.3200354609929077) internal successors, (1489), 1155 states have internal predecessors, (1489), 154 states have call successors, (154), 124 states have call predecessors, (154), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2024-11-06 23:57:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1877 transitions. [2024-11-06 23:57:15,340 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1877 transitions. Word has length 58 [2024-11-06 23:57:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1877 transitions. [2024-11-06 23:57:15,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 23:57:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1877 transitions. [2024-11-06 23:57:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:15,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:15,344 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] [2024-11-06 23:57:15,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:57:15,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:15,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2024-11-06 23:57:15,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:15,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023124900] [2024-11-06 23:57:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:57:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:57:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:57:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:57:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:57:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:57:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,430 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-06 23:57:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:15,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023124900] [2024-11-06 23:57:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023124900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:15,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:15,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 23:57:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794134473] [2024-11-06 23:57:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:15,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 23:57:15,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:15,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 23:57:15,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:57:15,431 INFO L87 Difference]: Start difference. First operand 1432 states and 1877 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:57:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:15,835 INFO L93 Difference]: Finished difference Result 3027 states and 3991 transitions. [2024-11-06 23:57:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 23:57:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-06 23:57:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:15,844 INFO L225 Difference]: With dead ends: 3027 [2024-11-06 23:57:15,845 INFO L226 Difference]: Without dead ends: 1617 [2024-11-06 23:57:15,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:57:15,847 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:15,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 493 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:57:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2024-11-06 23:57:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1477. [2024-11-06 23:57:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1164 states have (on average 1.302405498281787) internal successors, (1516), 1191 states have internal predecessors, (1516), 154 states have call successors, (154), 124 states have call predecessors, (154), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2024-11-06 23:57:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1916 transitions. [2024-11-06 23:57:15,937 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1916 transitions. Word has length 58 [2024-11-06 23:57:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:15,937 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 1916 transitions. [2024-11-06 23:57:15,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:57:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1916 transitions. [2024-11-06 23:57:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:15,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:15,938 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] [2024-11-06 23:57:15,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:57:15,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:15,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2024-11-06 23:57:15,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:15,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548750549] [2024-11-06 23:57:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:57:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:16,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:57:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-06 23:57:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:16,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:57:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:57:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 23:57:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:16,042 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-06 23:57:16,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:16,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548750549] [2024-11-06 23:57:16,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548750549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:16,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:16,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:57:16,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187276595] [2024-11-06 23:57:16,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:16,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:57:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:57:16,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:57:16,043 INFO L87 Difference]: Start difference. First operand 1477 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:16,569 INFO L93 Difference]: Finished difference Result 2912 states and 3753 transitions. [2024-11-06 23:57:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 23:57:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-11-06 23:57:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:16,577 INFO L225 Difference]: With dead ends: 2912 [2024-11-06 23:57:16,577 INFO L226 Difference]: Without dead ends: 1676 [2024-11-06 23:57:16,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-06 23:57:16,580 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 338 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:16,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 394 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:57:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-11-06 23:57:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1455. [2024-11-06 23:57:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1150 states have (on average 1.297391304347826) internal successors, (1492), 1171 states have internal predecessors, (1492), 154 states have call successors, (154), 124 states have call predecessors, (154), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2024-11-06 23:57:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1876 transitions. [2024-11-06 23:57:16,667 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1876 transitions. Word has length 58 [2024-11-06 23:57:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 1876 transitions. [2024-11-06 23:57:16,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:57:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1876 transitions. [2024-11-06 23:57:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 23:57:16,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:16,668 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] [2024-11-06 23:57:16,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:57:16,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:16,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2024-11-06 23:57:16,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:16,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419223951] [2024-11-06 23:57:16,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:57:16,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 23:57:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:57:16,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 23:57:16,705 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 23:57:16,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 23:57:16,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:57:16,709 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:57:16,758 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 23:57:16,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:57:16 BoogieIcfgContainer [2024-11-06 23:57:16,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 23:57:16,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 23:57:16,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 23:57:16,764 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 23:57:16,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:11" (3/4) ... [2024-11-06 23:57:16,765 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 23:57:16,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 23:57:16,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 23:57:16,822 INFO L158 Benchmark]: Toolchain (without parser) took 6007.62ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 91.9MB in the beginning and 70.6MB in the end (delta: 21.3MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-11-06 23:57:16,822 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 80.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:57:16,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.75ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:57:16,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.50ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:57:16,823 INFO L158 Benchmark]: Boogie Preprocessor took 37.64ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:57:16,824 INFO L158 Benchmark]: RCFGBuilder took 283.15ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 58.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 23:57:16,824 INFO L158 Benchmark]: TraceAbstraction took 5423.19ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 57.4MB in the beginning and 77.1MB in the end (delta: -19.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-06 23:57:16,824 INFO L158 Benchmark]: Witness Printer took 56.66ms. Allocated memory is still 192.9MB. Free memory was 77.1MB in the beginning and 70.6MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:57:16,826 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 80.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.75ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 78.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.50ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.64ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 75.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 283.15ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 58.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5423.19ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 57.4MB in the beginning and 77.1MB in the end (delta: -19.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 56.66ms. Allocated memory is still 192.9MB. Free memory was 77.1MB in the beginning and 70.6MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int q_buf_0 ; [L26] int q_free ; [L27] int q_read_ev ; [L28] int q_write_ev ; [L29] int q_req_up ; [L30] int q_ev ; [L51] int p_num_write ; [L52] int p_last_write ; [L53] int p_dw_st ; [L54] int p_dw_pc ; [L55] int p_dw_i ; [L56] int c_num_read ; [L57] int c_last_read ; [L58] int c_dr_st ; [L59] int c_dr_pc ; [L60] int c_dr_i ; [L164] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L466] int __retres1 ; [L470] CALL init_model() [L452] q_free = 1 [L453] q_write_ev = 2 [L454] q_read_ev = q_write_ev [L455] p_num_write = 0 [L456] p_dw_pc = 0 [L457] p_dw_i = 1 [L458] c_num_read = 0 [L459] c_dr_pc = 0 [L460] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L470] RET init_model() [L471] CALL start_simulation() [L406] int kernel_st ; [L407] int tmp ; [L411] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] CALL update_channels() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L222] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] RET update_channels() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] CALL init_threads() [L237] COND TRUE (int )p_dw_i == 1 [L238] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L242] COND TRUE (int )c_dr_i == 1 [L243] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] RET init_threads() [L414] CALL fire_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L275] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L280] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L414] RET fire_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] CALL activate_threads() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L308] int tmp ; [L309] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L62] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L65] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L75] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L77] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] tmp = is_do_write_p_triggered() [L315] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L321] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L81] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L84] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L94] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L96] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L321] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L321] tmp___0 = is_do_read_c_triggered() [L323] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] RET activate_threads() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] CALL reset_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L293] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L298] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] RET reset_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L419] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L422] kernel_st = 1 [L423] CALL eval() [L333] int tmp ; [L334] int tmp___0 ; [L335] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L339] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] CALL, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L252] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L255] COND TRUE (int )p_dw_st == 0 [L256] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L268] return (__retres1); VAL [\result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] RET, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] tmp___1 = exists_runnable_thread() [L344] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L349] COND TRUE (int )p_dw_st == 0 [L351] tmp = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L359] CALL error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L20] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2625 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2584 mSDsluCounter, 3429 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2679 mSDsCounter, 656 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3795 IncrementalHoareTripleChecker+Invalid, 4451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 656 mSolverCounterUnsat, 750 mSDtfsCounter, 3795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 779 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-06 23:57:16,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE