./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-16 01:06:15,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:06:15,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:06:15,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:06:15,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:06:15,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:06:15,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:06:15,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:06:15,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:06:15,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:06:15,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:06:15,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:06:15,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:06:15,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:06:15,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:06:15,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:06:15,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:06:15,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:06:15,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:06:15,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:06:15,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:06:15,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:06:15,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:06:15,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:06:15,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:06:15,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:06:15,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:06:15,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:06:15,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:06:15,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:06:15,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:06:15,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:06:15,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:06:15,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:06:15,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:06:15,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:06:15,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:06:15,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:06:15,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:06:15,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:06:15,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:06:15,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:06:15,847 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:06:15,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:06:15,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:06:15,852 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:06:15,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:06:15,853 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:06:15,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:06:15,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:06:15,853 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:06:15,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:06:15,854 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:06:15,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:06:15,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:06:15,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:06:15,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:06:15,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:06:15,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:06:15,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:15,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:06:15,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:06:15,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:06:15,858 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-16 01:06:16,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:06:16,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:06:16,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:06:16,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:06:16,083 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:06:16,084 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-16 01:06:16,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4608cec24/285f163e1113499faf67f9ce1fc4ff34/FLAGa85aecefa [2021-12-16 01:06:16,511 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:06:16,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2021-12-16 01:06:16,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4608cec24/285f163e1113499faf67f9ce1fc4ff34/FLAGa85aecefa [2021-12-16 01:06:16,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4608cec24/285f163e1113499faf67f9ce1fc4ff34 [2021-12-16 01:06:16,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:06:16,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:06:16,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:16,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:06:16,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:06:16,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196b25ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16, skipping insertion in model container [2021-12-16 01:06:16,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:06:16,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:06:16,773 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-16 01:06:16,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:16,854 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:06:16,873 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-16 01:06:16,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:16,908 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:06:16,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16 WrapperNode [2021-12-16 01:06:16,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:16,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:16,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:06:16,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:06:16,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,935 INFO L137 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 188 [2021-12-16 01:06:16,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:16,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:06:16,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:06:16,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:06:16,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:06:16,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:06:16,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:06:16,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:06:16,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:16,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:17,017 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-16 01:06:17,064 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-16 01:06:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:06:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-16 01:06:17,085 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-16 01:06:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-16 01:06:17,085 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-16 01:06:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-16 01:06:17,085 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-16 01:06:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-16 01:06:17,086 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-16 01:06:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-16 01:06:17,086 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-16 01:06:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-16 01:06:17,086 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-16 01:06:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:06:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-16 01:06:17,086 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-16 01:06:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:06:17,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:06:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-16 01:06:17,087 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-16 01:06:17,153 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:06:17,154 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:06:17,339 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:06:17,344 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:06:17,344 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 01:06:17,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:17 BoogieIcfgContainer [2021-12-16 01:06:17,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:06:17,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:06:17,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:06:17,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:06:17,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:06:16" (1/3) ... [2021-12-16 01:06:17,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46520f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:17, skipping insertion in model container [2021-12-16 01:06:17,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (2/3) ... [2021-12-16 01:06:17,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46520f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:17, skipping insertion in model container [2021-12-16 01:06:17,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:17" (3/3) ... [2021-12-16 01:06:17,351 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2021-12-16 01:06:17,354 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:06:17,354 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:06:17,384 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:06:17,389 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-16 01:06:17,389 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:06:17,401 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-16 01:06:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:17,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:17,406 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-16 01:06:17,407 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash -651219767, now seen corresponding path program 1 times [2021-12-16 01:06:17,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:17,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547377344] [2021-12-16 01:06:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:17,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,591 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-16 01:06:17,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:17,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547377344] [2021-12-16 01:06:17,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547377344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:17,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:17,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:17,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912681669] [2021-12-16 01:06:17,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:17,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:17,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:17,631 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-16 01:06:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:17,933 INFO L93 Difference]: Finished difference Result 217 states and 317 transitions. [2021-12-16 01:06:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:06:17,937 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-16 01:06:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:17,944 INFO L225 Difference]: With dead ends: 217 [2021-12-16 01:06:17,944 INFO L226 Difference]: Without dead ends: 116 [2021-12-16 01:06:17,947 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-16 01:06:17,949 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-16 01:06:17,950 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-16 01:06:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-16 01:06:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-12-16 01:06:17,980 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-16 01:06:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2021-12-16 01:06:17,982 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 58 [2021-12-16 01:06:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:17,983 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2021-12-16 01:06:17,983 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-16 01:06:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2021-12-16 01:06:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:17,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:17,985 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-16 01:06:17,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:06:17,985 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -635701049, now seen corresponding path program 1 times [2021-12-16 01:06:17,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:17,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447622276] [2021-12-16 01:06:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:17,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,077 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-16 01:06:18,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:18,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447622276] [2021-12-16 01:06:18,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447622276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:18,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:18,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:06:18,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574935429] [2021-12-16 01:06:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:18,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:06:18,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:06:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:18,080 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-16 01:06:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:18,444 INFO L93 Difference]: Finished difference Result 323 states and 448 transitions. [2021-12-16 01:06:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 01:06:18,444 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-16 01:06:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:18,447 INFO L225 Difference]: With dead ends: 323 [2021-12-16 01:06:18,447 INFO L226 Difference]: Without dead ends: 234 [2021-12-16 01:06:18,447 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-16 01:06:18,448 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-16 01:06:18,449 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-16 01:06:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-16 01:06:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2021-12-16 01:06:18,466 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-16 01:06:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2021-12-16 01:06:18,468 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 58 [2021-12-16 01:06:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:18,468 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2021-12-16 01:06:18,468 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-16 01:06:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2021-12-16 01:06:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:18,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:18,470 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-16 01:06:18,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:06:18,471 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 126948582, now seen corresponding path program 1 times [2021-12-16 01:06:18,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:18,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253985514] [2021-12-16 01:06:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:18,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,556 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-16 01:06:18,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:18,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253985514] [2021-12-16 01:06:18,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253985514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:18,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:18,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:06:18,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036444089] [2021-12-16 01:06:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:18,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:06:18,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:18,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:06:18,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:18,559 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-16 01:06:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:19,008 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2021-12-16 01:06:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 01:06:19,008 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-16 01:06:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:19,011 INFO L225 Difference]: With dead ends: 543 [2021-12-16 01:06:19,011 INFO L226 Difference]: Without dead ends: 365 [2021-12-16 01:06:19,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-16 01:06:19,013 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 438 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 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-16 01:06:19,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 694 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-16 01:06:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 290. [2021-12-16 01:06:19,033 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-16 01:06:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2021-12-16 01:06:19,035 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 58 [2021-12-16 01:06:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:19,035 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2021-12-16 01:06:19,035 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-16 01:06:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2021-12-16 01:06:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:19,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:19,037 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-16 01:06:19,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 01:06:19,037 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1020434920, now seen corresponding path program 1 times [2021-12-16 01:06:19,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:19,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527206292] [2021-12-16 01:06:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:19,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,140 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-16 01:06:19,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:19,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527206292] [2021-12-16 01:06:19,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527206292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:19,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:19,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 01:06:19,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724160361] [2021-12-16 01:06:19,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:19,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 01:06:19,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 01:06:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:06:19,142 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-16 01:06:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:19,486 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2021-12-16 01:06:19,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 01:06:19,487 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-16 01:06:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:19,490 INFO L225 Difference]: With dead ends: 592 [2021-12-16 01:06:19,490 INFO L226 Difference]: Without dead ends: 324 [2021-12-16 01:06:19,493 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-16 01:06:19,494 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 01:06:19,494 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-16 01:06:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-16 01:06:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 295. [2021-12-16 01:06:19,509 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-16 01:06:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2021-12-16 01:06:19,513 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 58 [2021-12-16 01:06:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:19,514 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2021-12-16 01:06:19,514 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-16 01:06:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2021-12-16 01:06:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:19,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:19,516 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-16 01:06:19,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:06:19,517 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:19,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1295194534, now seen corresponding path program 1 times [2021-12-16 01:06:19,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:19,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054429186] [2021-12-16 01:06:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:19,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,588 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-16 01:06:19,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054429186] [2021-12-16 01:06:19,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054429186] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:19,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:19,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 01:06:19,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949641189] [2021-12-16 01:06:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:19,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 01:06:19,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 01:06:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-16 01:06:19,591 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-16 01:06:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:20,646 INFO L93 Difference]: Finished difference Result 1631 states and 2204 transitions. [2021-12-16 01:06:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-16 01:06:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2021-12-16 01:06:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:20,651 INFO L225 Difference]: With dead ends: 1631 [2021-12-16 01:06:20,652 INFO L226 Difference]: Without dead ends: 1340 [2021-12-16 01:06:20,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-16 01:06:20,653 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1180 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:20,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1194 Valid, 1061 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 01:06:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2021-12-16 01:06:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1196. [2021-12-16 01:06:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 946 states have (on average 1.3266384778012685) internal successors, (1255), 968 states have internal predecessors, (1255), 125 states have call successors, (125), 105 states have call predecessors, (125), 124 states have return successors, (162), 124 states have call predecessors, (162), 122 states have call successors, (162) [2021-12-16 01:06:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1542 transitions. [2021-12-16 01:06:20,697 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1542 transitions. Word has length 58 [2021-12-16 01:06:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:20,697 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 1542 transitions. [2021-12-16 01:06:20,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-16 01:06:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1542 transitions. [2021-12-16 01:06:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:20,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:20,699 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-16 01:06:20,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:06:20,699 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 323519847, now seen corresponding path program 1 times [2021-12-16 01:06:20,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:20,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903096827] [2021-12-16 01:06:20,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:20,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,808 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-16 01:06:20,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903096827] [2021-12-16 01:06:20,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903096827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:20,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:20,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 01:06:20,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587378714] [2021-12-16 01:06:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:20,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 01:06:20,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 01:06:20,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:06:20,810 INFO L87 Difference]: Start difference. First operand 1196 states and 1542 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-16 01:06:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:21,104 INFO L93 Difference]: Finished difference Result 2488 states and 3216 transitions. [2021-12-16 01:06:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 01:06:21,105 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-16 01:06:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:21,110 INFO L225 Difference]: With dead ends: 2488 [2021-12-16 01:06:21,110 INFO L226 Difference]: Without dead ends: 1302 [2021-12-16 01:06:21,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-16 01:06:21,112 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 165 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:21,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 536 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-12-16 01:06:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1226. [2021-12-16 01:06:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 970 states have (on average 1.3103092783505155) internal successors, (1271), 992 states have internal predecessors, (1271), 125 states have call successors, (125), 105 states have call predecessors, (125), 130 states have return successors, (168), 130 states have call predecessors, (168), 122 states have call successors, (168) [2021-12-16 01:06:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1564 transitions. [2021-12-16 01:06:21,156 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1564 transitions. Word has length 58 [2021-12-16 01:06:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:21,156 INFO L470 AbstractCegarLoop]: Abstraction has 1226 states and 1564 transitions. [2021-12-16 01:06:21,156 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-16 01:06:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1564 transitions. [2021-12-16 01:06:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:21,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:21,157 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-16 01:06:21,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 01:06:21,158 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1481918487, now seen corresponding path program 1 times [2021-12-16 01:06:21,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:21,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819953442] [2021-12-16 01:06:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:21,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,239 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-16 01:06:21,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:21,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819953442] [2021-12-16 01:06:21,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819953442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:21,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:21,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:06:21,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505326226] [2021-12-16 01:06:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:21,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:06:21,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:06:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:21,241 INFO L87 Difference]: Start difference. First operand 1226 states and 1564 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-16 01:06:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:21,638 INFO L93 Difference]: Finished difference Result 2483 states and 3113 transitions. [2021-12-16 01:06:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 01:06:21,638 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-16 01:06:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:21,643 INFO L225 Difference]: With dead ends: 2483 [2021-12-16 01:06:21,643 INFO L226 Difference]: Without dead ends: 1490 [2021-12-16 01:06:21,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-16 01:06:21,645 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 329 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:21,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 512 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2021-12-16 01:06:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1168. [2021-12-16 01:06:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 928 states have (on average 1.3038793103448276) internal successors, (1210), 945 states have internal predecessors, (1210), 119 states have call successors, (119), 100 states have call predecessors, (119), 120 states have return successors, (153), 123 states have call predecessors, (153), 116 states have call successors, (153) [2021-12-16 01:06:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1482 transitions. [2021-12-16 01:06:21,708 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1482 transitions. Word has length 58 [2021-12-16 01:06:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:21,708 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 1482 transitions. [2021-12-16 01:06:21,708 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-16 01:06:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1482 transitions. [2021-12-16 01:06:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:06:21,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:21,709 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-16 01:06:21,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 01:06:21,709 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 818904103, now seen corresponding path program 1 times [2021-12-16 01:06:21,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:21,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464394386] [2021-12-16 01:06:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:21,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:06:21,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 01:06:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:06:21,735 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 01:06:21,735 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 01:06:21,736 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:06:21,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 01:06:21,739 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:21,741 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:06:21,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:06:21 BoogieIcfgContainer [2021-12-16 01:06:21,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:06:21,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:06:21,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:06:21,782 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:06:21,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:17" (3/4) ... [2021-12-16 01:06:21,783 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 01:06:21,844 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:06:21,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:06:21,845 INFO L158 Benchmark]: Toolchain (without parser) took 5306.33ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 121.8MB in the beginning and 167.8MB in the end (delta: -46.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2021-12-16 01:06:21,845 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:06:21,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.84ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 125.0MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 01:06:21,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.95ms. Allocated memory is still 153.1MB. Free memory was 125.0MB in the beginning and 123.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:21,846 INFO L158 Benchmark]: Boogie Preprocessor took 19.34ms. Allocated memory is still 153.1MB. Free memory was 123.3MB in the beginning and 121.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:21,846 INFO L158 Benchmark]: RCFGBuilder took 389.35ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 106.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-16 01:06:21,847 INFO L158 Benchmark]: TraceAbstraction took 4434.76ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 106.1MB in the beginning and 175.1MB in the end (delta: -69.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2021-12-16 01:06:21,847 INFO L158 Benchmark]: Witness Printer took 63.01ms. Allocated memory is still 247.5MB. Free memory was 175.1MB in the beginning and 167.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 01:06:21,849 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.15ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.84ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 125.0MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.95ms. Allocated memory is still 153.1MB. Free memory was 125.0MB in the beginning and 123.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.34ms. Allocated memory is still 153.1MB. Free memory was 123.3MB in the beginning and 121.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.35ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 106.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4434.76ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 106.1MB in the beginning and 175.1MB in the end (delta: -69.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 63.01ms. Allocated memory is still 247.5MB. Free memory was 175.1MB in the beginning and 167.8MB 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.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2957 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2914 mSDsluCounter, 4091 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2972 mSDsCounter, 920 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3393 IncrementalHoareTripleChecker+Invalid, 4313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 920 mSolverCounterUnsat, 1119 mSDtfsCounter, 3393 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1226occurred 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 704 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 853 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-16 01:06:21,883 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