./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 e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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.2.2-dev-e19ca92 [2021-12-22 11:43:08,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 11:43:08,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 11:43:08,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 11:43:08,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 11:43:08,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 11:43:08,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 11:43:08,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 11:43:08,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 11:43:08,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 11:43:08,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 11:43:08,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 11:43:08,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 11:43:08,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 11:43:08,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 11:43:08,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 11:43:08,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 11:43:08,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 11:43:08,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 11:43:08,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 11:43:08,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 11:43:08,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 11:43:08,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 11:43:08,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 11:43:08,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 11:43:08,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 11:43:08,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 11:43:08,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 11:43:08,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 11:43:08,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 11:43:08,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 11:43:08,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 11:43:08,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 11:43:08,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 11:43:08,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 11:43:08,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 11:43:08,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 11:43:08,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 11:43:08,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 11:43:08,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 11:43:08,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 11:43:08,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 11:43:08,939 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 11:43:08,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 11:43:08,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 11:43:08,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 11:43:08,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 11:43:08,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 11:43:08,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 11:43:08,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 11:43:08,942 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 11:43:08,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 11:43:08,943 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 11:43:08,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 11:43:08,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 11:43:08,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 11:43:08,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 11:43:08,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 11:43:08,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 11:43:08,944 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 11:43:08,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 11:43:08,944 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 11:43:08,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 11:43:08,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 11:43:08,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 11:43:08,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 11:43:08,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:43:08,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 11:43:08,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 11:43:08,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 11:43:08,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 11:43:08,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 11:43:08,947 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 11:43:08,947 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 11:43:08,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 11:43:08,947 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 11:43:08,947 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2021-12-22 11:43:09,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 11:43:09,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 11:43:09,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 11:43:09,144 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 11:43:09,145 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 11:43:09,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2021-12-22 11:43:09,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7f23a35/cb7d0b0899f6458fb21edb11fe1d4199/FLAG51d0dfc48 [2021-12-22 11:43:09,544 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 11:43:09,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2021-12-22 11:43:09,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7f23a35/cb7d0b0899f6458fb21edb11fe1d4199/FLAG51d0dfc48 [2021-12-22 11:43:09,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7f23a35/cb7d0b0899f6458fb21edb11fe1d4199 [2021-12-22 11:43:09,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 11:43:09,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 11:43:09,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 11:43:09,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 11:43:09,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 11:43:09,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:43:09" (1/1) ... [2021-12-22 11:43:09,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea006c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:09, skipping insertion in model container [2021-12-22 11:43:09,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:43:09" (1/1) ... [2021-12-22 11:43:09,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 11:43:10,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 11:43:10,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2021-12-22 11:43:10,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:43:10,130 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 11:43:10,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c[643,656] [2021-12-22 11:43:10,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:43:10,188 INFO L208 MainTranslator]: Completed translation [2021-12-22 11:43:10,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10 WrapperNode [2021-12-22 11:43:10,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 11:43:10,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 11:43:10,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 11:43:10,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 11:43:10,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,215 INFO L137 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 188 [2021-12-22 11:43:10,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 11:43:10,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 11:43:10,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 11:43:10,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 11:43:10,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 11:43:10,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 11:43:10,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 11:43:10,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 11:43:10,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (1/1) ... [2021-12-22 11:43:10,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:43:10,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:10,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 11:43:10,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 11:43:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 11:43:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-22 11:43:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-22 11:43:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-22 11:43:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-22 11:43:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-22 11:43:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-22 11:43:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-22 11:43:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-22 11:43:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-22 11:43:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-22 11:43:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-22 11:43:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-22 11:43:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 11:43:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-22 11:43:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-22 11:43:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 11:43:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 11:43:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-22 11:43:10,293 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-22 11:43:10,341 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 11:43:10,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 11:43:10,531 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 11:43:10,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 11:43:10,538 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-22 11:43:10,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:43:10 BoogieIcfgContainer [2021-12-22 11:43:10,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 11:43:10,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 11:43:10,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 11:43:10,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 11:43:10,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:43:09" (1/3) ... [2021-12-22 11:43:10,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a20d11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:43:10, skipping insertion in model container [2021-12-22 11:43:10,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:10" (2/3) ... [2021-12-22 11:43:10,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a20d11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:43:10, skipping insertion in model container [2021-12-22 11:43:10,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:43:10" (3/3) ... [2021-12-22 11:43:10,556 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2021-12-22 11:43:10,560 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 11:43:10,561 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 11:43:10,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 11:43:10,624 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 11:43:10,625 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 11:43:10,639 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) [2021-12-22 11:43:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:10,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:10,645 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:10,645 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2021-12-22 11:43:10,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:10,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611709644] [2021-12-22 11:43:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:10,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:10,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:10,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611709644] [2021-12-22 11:43:10,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611709644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:10,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:10,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 11:43:10,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407717842] [2021-12-22 11:43:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:10,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 11:43:10,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 11:43:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 11:43:10,983 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) [2021-12-22 11:43:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:11,279 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2021-12-22 11:43:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 11:43:11,281 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 [2021-12-22 11:43:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:11,288 INFO L225 Difference]: With dead ends: 217 [2021-12-22 11:43:11,288 INFO L226 Difference]: Without dead ends: 116 [2021-12-22 11:43:11,291 INFO L932 BasicCegarLoop]: 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 [2021-12-22 11:43:11,294 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 210 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:11,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 300 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-22 11:43:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-12-22 11:43:11,326 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) [2021-12-22 11:43:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2021-12-22 11:43:11,329 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2021-12-22 11:43:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:11,330 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2021-12-22 11:43:11,330 INFO L471 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) [2021-12-22 11:43:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2021-12-22 11:43:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:11,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:11,332 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:11,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 11:43:11,333 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2021-12-22 11:43:11,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:11,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399765944] [2021-12-22 11:43:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:11,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:11,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:11,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399765944] [2021-12-22 11:43:11,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399765944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:11,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:11,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 11:43:11,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736223826] [2021-12-22 11:43:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:11,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 11:43:11,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:11,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 11:43:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:11,444 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) [2021-12-22 11:43:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:11,835 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2021-12-22 11:43:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 11:43:11,835 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 [2021-12-22 11:43:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:11,838 INFO L225 Difference]: With dead ends: 323 [2021-12-22 11:43:11,838 INFO L226 Difference]: Without dead ends: 234 [2021-12-22 11:43:11,839 INFO L932 BasicCegarLoop]: 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 [2021-12-22 11:43:11,840 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 478 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:11,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 379 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:43:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-22 11:43:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2021-12-22 11:43:11,861 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) [2021-12-22 11:43:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2021-12-22 11:43:11,864 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2021-12-22 11:43:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:11,864 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2021-12-22 11:43:11,864 INFO L471 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) [2021-12-22 11:43:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2021-12-22 11:43:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:11,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:11,866 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:11,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 11:43:11,866 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2021-12-22 11:43:11,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:11,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271167828] [2021-12-22 11:43:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:11,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:11,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:11,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271167828] [2021-12-22 11:43:11,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271167828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:11,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:11,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 11:43:11,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46049245] [2021-12-22 11:43:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:11,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 11:43:11,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 11:43:11,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:11,974 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) [2021-12-22 11:43:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:12,423 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2021-12-22 11:43:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 11:43:12,423 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 [2021-12-22 11:43:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:12,426 INFO L225 Difference]: With dead ends: 543 [2021-12-22 11:43:12,426 INFO L226 Difference]: Without dead ends: 365 [2021-12-22 11:43:12,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-22 11:43:12,428 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 438 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:12,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 694 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:43:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-22 11:43:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2021-12-22 11:43:12,449 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) [2021-12-22 11:43:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2021-12-22 11:43:12,451 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2021-12-22 11:43:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:12,451 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2021-12-22 11:43:12,451 INFO L471 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) [2021-12-22 11:43:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2021-12-22 11:43:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:12,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:12,453 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:12,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 11:43:12,453 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2021-12-22 11:43:12,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:12,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600175356] [2021-12-22 11:43:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:12,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:12,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:12,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600175356] [2021-12-22 11:43:12,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600175356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:12,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:12,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 11:43:12,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459119536] [2021-12-22 11:43:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:12,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 11:43:12,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 11:43:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:12,609 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) [2021-12-22 11:43:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:12,900 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2021-12-22 11:43:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 11:43:12,900 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 [2021-12-22 11:43:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:12,902 INFO L225 Difference]: With dead ends: 592 [2021-12-22 11:43:12,902 INFO L226 Difference]: Without dead ends: 324 [2021-12-22 11:43:12,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 11:43:12,904 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:12,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 609 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-22 11:43:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 295. [2021-12-22 11:43:12,919 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) [2021-12-22 11:43:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2021-12-22 11:43:12,921 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2021-12-22 11:43:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:12,921 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2021-12-22 11:43:12,921 INFO L471 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) [2021-12-22 11:43:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2021-12-22 11:43:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:12,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:12,923 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:12,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 11:43:12,924 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2021-12-22 11:43:12,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960276572] [2021-12-22 11:43:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:12,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:13,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:13,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:13,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960276572] [2021-12-22 11:43:13,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960276572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:13,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:13,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 11:43:13,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84231415] [2021-12-22 11:43:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:13,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 11:43:13,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 11:43:13,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:13,025 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) [2021-12-22 11:43:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:14,171 INFO L93 Difference]: Finished difference Result 1963 states and 2677 transitions. [2021-12-22 11:43:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 11:43:14,172 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 [2021-12-22 11:43:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:14,178 INFO L225 Difference]: With dead ends: 1963 [2021-12-22 11:43:14,178 INFO L226 Difference]: Without dead ends: 1690 [2021-12-22 11:43:14,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-22 11:43:14,181 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 1152 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:14,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1170 Valid, 932 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 11:43:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2021-12-22 11:43:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1432. [2021-12-22 11:43:14,288 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) [2021-12-22 11:43:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1877 transitions. [2021-12-22 11:43:14,294 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1877 transitions. Word has length 58 [2021-12-22 11:43:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:14,294 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 1877 transitions. [2021-12-22 11:43:14,294 INFO L471 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) [2021-12-22 11:43:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1877 transitions. [2021-12-22 11:43:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:14,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:14,312 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:14,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 11:43:14,313 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2021-12-22 11:43:14,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:14,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178299121] [2021-12-22 11:43:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:14,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:14,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:14,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178299121] [2021-12-22 11:43:14,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178299121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:14,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:14,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 11:43:14,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150052116] [2021-12-22 11:43:14,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:14,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 11:43:14,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:14,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 11:43:14,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:14,395 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) [2021-12-22 11:43:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:14,736 INFO L93 Difference]: Finished difference Result 3031 states and 3996 transitions. [2021-12-22 11:43:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 11:43:14,738 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 [2021-12-22 11:43:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:14,745 INFO L225 Difference]: With dead ends: 3031 [2021-12-22 11:43:14,745 INFO L226 Difference]: Without dead ends: 1621 [2021-12-22 11:43:14,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 11:43:14,751 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 162 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:14,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 549 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2021-12-22 11:43:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1477. [2021-12-22 11:43:14,831 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) [2021-12-22 11:43:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1916 transitions. [2021-12-22 11:43:14,838 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1916 transitions. Word has length 58 [2021-12-22 11:43:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:14,839 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 1916 transitions. [2021-12-22 11:43:14,839 INFO L471 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) [2021-12-22 11:43:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1916 transitions. [2021-12-22 11:43:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:14,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:14,841 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:14,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 11:43:14,841 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2021-12-22 11:43:14,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:14,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901240236] [2021-12-22 11:43:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:14,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:14,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:14,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901240236] [2021-12-22 11:43:14,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901240236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:14,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:14,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 11:43:14,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970465471] [2021-12-22 11:43:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:14,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 11:43:14,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 11:43:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:14,944 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) [2021-12-22 11:43:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:15,364 INFO L93 Difference]: Finished difference Result 2912 states and 3753 transitions. [2021-12-22 11:43:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 11:43:15,365 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 [2021-12-22 11:43:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:15,371 INFO L225 Difference]: With dead ends: 2912 [2021-12-22 11:43:15,371 INFO L226 Difference]: Without dead ends: 1676 [2021-12-22 11:43:15,374 INFO L932 BasicCegarLoop]: 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 [2021-12-22 11:43:15,375 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 333 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:15,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 519 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:43:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2021-12-22 11:43:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1455. [2021-12-22 11:43:15,432 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) [2021-12-22 11:43:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1876 transitions. [2021-12-22 11:43:15,437 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1876 transitions. Word has length 58 [2021-12-22 11:43:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:15,437 INFO L470 AbstractCegarLoop]: Abstraction has 1455 states and 1876 transitions. [2021-12-22 11:43:15,437 INFO L471 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) [2021-12-22 11:43:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1876 transitions. [2021-12-22 11:43:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 11:43:15,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:15,438 INFO L514 BasicCegarLoop]: 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] [2021-12-22 11:43:15,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 11:43:15,438 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:15,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2021-12-22 11:43:15,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:15,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295351824] [2021-12-22 11:43:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:15,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:43:15,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 11:43:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:43:15,466 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 11:43:15,466 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 11:43:15,467 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 11:43:15,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 11:43:15,470 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:15,472 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 11:43:15,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:43:15 BoogieIcfgContainer [2021-12-22 11:43:15,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 11:43:15,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 11:43:15,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 11:43:15,520 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 11:43:15,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:43:10" (3/4) ... [2021-12-22 11:43:15,521 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 11:43:15,559 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 11:43:15,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 11:43:15,560 INFO L158 Benchmark]: Toolchain (without parser) took 5597.22ms. Allocated memory was 90.2MB in the beginning and 161.5MB in the end (delta: 71.3MB). Free memory was 66.5MB in the beginning and 62.4MB in the end (delta: 4.1MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2021-12-22 11:43:15,560 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 44.2MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:43:15,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.35ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 67.5MB in the end (delta: -1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 11:43:15,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.79ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 65.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:43:15,561 INFO L158 Benchmark]: Boogie Preprocessor took 17.67ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 64.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 11:43:15,561 INFO L158 Benchmark]: RCFGBuilder took 306.17ms. Allocated memory is still 90.2MB. Free memory was 64.2MB in the beginning and 49.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-22 11:43:15,562 INFO L158 Benchmark]: TraceAbstraction took 4977.52ms. Allocated memory was 90.2MB in the beginning and 161.5MB in the end (delta: 71.3MB). Free memory was 49.0MB in the beginning and 70.8MB in the end (delta: -21.8MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2021-12-22 11:43:15,562 INFO L158 Benchmark]: Witness Printer took 40.53ms. Allocated memory is still 161.5MB. Free memory was 69.8MB in the beginning and 62.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 11:43:15,563 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 44.2MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.35ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 67.5MB in the end (delta: -1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.79ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 65.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.67ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 64.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.17ms. Allocated memory is still 90.2MB. Free memory was 64.2MB in the beginning and 49.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4977.52ms. Allocated memory was 90.2MB in the beginning and 161.5MB in the end (delta: 71.3MB). Free memory was 49.0MB in the beginning and 70.8MB in the end (delta: -21.8MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * Witness Printer took 40.53ms. Allocated memory is still 161.5MB. Free memory was 69.8MB in the beginning and 62.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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, kernel_st=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, kernel_st=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, kernel_st=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, __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] [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, is_do_write_p_triggered()=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, tmp=0] [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, __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] [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, is_do_read_c_triggered()=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, tmp=0] [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, tmp=0, tmp___0=0] [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, kernel_st=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, kernel_st=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, kernel_st=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, __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] [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, exists_runnable_thread()=1, 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, tmp___1=1] [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, tmp=0, tmp___1=1] [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: 4.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2932 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2887 mSDsluCounter, 3982 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2760 mSDsCounter, 934 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3018 IncrementalHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 934 mSolverCounterUnsat, 1222 mSDtfsCounter, 3018 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 785 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 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! [2021-12-22 11:43:15,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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