./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/combinations/Problem05_label45+token_ring.01.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 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 15:43:26,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 15:43:26,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 15:43:26,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 15:43:26,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 15:43:26,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 15:43:26,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 15:43:26,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 15:43:26,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 15:43:26,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 15:43:26,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 15:43:26,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 15:43:26,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 15:43:26,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 15:43:26,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 15:43:26,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 15:43:26,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 15:43:26,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 15:43:26,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 15:43:26,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 15:43:26,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 15:43:26,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 15:43:26,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 15:43:26,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 15:43:26,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 15:43:26,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 15:43:26,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 15:43:26,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 15:43:26,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 15:43:26,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 15:43:26,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 15:43:26,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 15:43:26,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 15:43:26,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 15:43:26,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 15:43:26,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 15:43:26,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 15:43:26,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 15:43:26,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 15:43:26,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 15:43:26,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 15:43:26,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 15:43:27,014 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 15:43:27,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 15:43:27,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 15:43:27,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 15:43:27,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 15:43:27,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 15:43:27,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 15:43:27,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 15:43:27,017 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 15:43:27,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 15:43:27,017 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 15:43:27,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 15:43:27,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 15:43:27,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 15:43:27,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 15:43:27,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 15:43:27,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 15:43:27,018 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 15:43:27,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 15:43:27,018 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 15:43:27,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 15:43:27,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 15:43:27,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 15:43:27,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 15:43:27,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:43:27,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 15:43:27,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 15:43:27,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 15:43:27,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 15:43:27,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 15:43:27,020 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 15:43:27,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 15:43:27,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 15:43:27,021 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 15:43:27,021 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 -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 [2021-12-14 15:43:27,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 15:43:27,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 15:43:27,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 15:43:27,217 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 15:43:27,218 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 15:43:27,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2021-12-14 15:43:27,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725b7c66a/ce265e8009b3412cb196b5ba2f9cafc8/FLAGaa8564777 [2021-12-14 15:43:27,958 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 15:43:27,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2021-12-14 15:43:27,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725b7c66a/ce265e8009b3412cb196b5ba2f9cafc8/FLAGaa8564777 [2021-12-14 15:43:28,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725b7c66a/ce265e8009b3412cb196b5ba2f9cafc8 [2021-12-14 15:43:28,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 15:43:28,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 15:43:28,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 15:43:28,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 15:43:28,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 15:43:28,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:43:28" (1/1) ... [2021-12-14 15:43:28,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c25dd1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:28, skipping insertion in model container [2021-12-14 15:43:28,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:43:28" (1/1) ... [2021-12-14 15:43:28,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 15:43:28,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 15:43:29,712 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/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2021-12-14 15:43:29,735 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/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2021-12-14 15:43:29,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:43:29,849 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 15:43:30,453 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/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2021-12-14 15:43:30,458 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/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2021-12-14 15:43:30,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 15:43:30,545 INFO L208 MainTranslator]: Completed translation [2021-12-14 15:43:30,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30 WrapperNode [2021-12-14 15:43:30,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 15:43:30,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 15:43:30,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 15:43:30,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 15:43:30,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:30,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:30,866 INFO L137 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2021-12-14 15:43:30,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 15:43:30,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 15:43:30,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 15:43:30,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 15:43:30,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:30,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:30,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:30,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:31,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:31,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:31,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:31,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 15:43:31,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 15:43:31,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 15:43:31,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 15:43:31,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (1/1) ... [2021-12-14 15:43:31,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 15:43:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:31,221 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-14 15:43:31,238 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-14 15:43:31,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 15:43:31,250 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-14 15:43:31,250 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-14 15:43:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-14 15:43:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-14 15:43:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-14 15:43:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-14 15:43:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 15:43:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 15:43:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-14 15:43:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-14 15:43:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-14 15:43:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-14 15:43:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 15:43:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-14 15:43:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-14 15:43:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 15:43:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 15:43:31,313 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 15:43:31,315 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 15:43:35,830 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 15:43:35,853 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 15:43:35,853 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 15:43:35,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:43:35 BoogieIcfgContainer [2021-12-14 15:43:35,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 15:43:35,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 15:43:35,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 15:43:35,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 15:43:35,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:43:28" (1/3) ... [2021-12-14 15:43:35,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee57b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:43:35, skipping insertion in model container [2021-12-14 15:43:35,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:43:30" (2/3) ... [2021-12-14 15:43:35,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee57b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:43:35, skipping insertion in model container [2021-12-14 15:43:35,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:43:35" (3/3) ... [2021-12-14 15:43:35,865 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.01.cil-2.c [2021-12-14 15:43:35,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 15:43:35,869 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 15:43:35,909 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 15:43:35,913 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-14 15:43:35,914 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 15:43:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-14 15:43:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:43:35,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:35,954 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-14 15:43:35,955 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2021-12-14 15:43:35,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:35,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987609676] [2021-12-14 15:43:35,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:35,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,155 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-14 15:43:36,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987609676] [2021-12-14 15:43:36,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987609676] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:36,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:36,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:43:36,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631011480] [2021-12-14 15:43:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:36,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:43:36,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:36,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:43:36,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:43:36,212 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:36,755 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2021-12-14 15:43:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:43:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 15:43:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:36,781 INFO L225 Difference]: With dead ends: 4727 [2021-12-14 15:43:36,782 INFO L226 Difference]: Without dead ends: 2368 [2021-12-14 15:43:36,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:43:36,796 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12409 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16608 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:36,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4337 Valid, 16608 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 15:43:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-12-14 15:43:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2021-12-14 15:43:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-14 15:43:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2021-12-14 15:43:36,911 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2021-12-14 15:43:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:36,912 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2021-12-14 15:43:36,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2021-12-14 15:43:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:43:36,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:36,915 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-14 15:43:36,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 15:43:36,915 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2021-12-14 15:43:36,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:36,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844284452] [2021-12-14 15:43:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:36,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:36,995 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-14 15:43:36,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:36,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844284452] [2021-12-14 15:43:36,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844284452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:36,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:36,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:43:36,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116575367] [2021-12-14 15:43:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:36,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:43:36,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:43:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:36,999 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:37,306 INFO L93 Difference]: Finished difference Result 2561 states and 4601 transitions. [2021-12-14 15:43:37,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 15:43:37,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 15:43:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:37,316 INFO L225 Difference]: With dead ends: 2561 [2021-12-14 15:43:37,316 INFO L226 Difference]: Without dead ends: 2366 [2021-12-14 15:43:37,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:43:37,319 INFO L933 BasicCegarLoop]: 4096 mSDtfsCounter, 4187 mSDsluCounter, 16100 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 20196 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:37,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4196 Valid, 20196 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:43:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-12-14 15:43:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2325. [2021-12-14 15:43:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.8374945247481385) internal successors, (4195), 2287 states have internal predecessors, (4195), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-14 15:43:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4250 transitions. [2021-12-14 15:43:37,368 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4250 transitions. Word has length 58 [2021-12-14 15:43:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:37,368 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4250 transitions. [2021-12-14 15:43:37,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4250 transitions. [2021-12-14 15:43:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:43:37,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:37,370 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-14 15:43:37,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 15:43:37,370 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2021-12-14 15:43:37,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:37,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125188642] [2021-12-14 15:43:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:37,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 15:43:37,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:37,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125188642] [2021-12-14 15:43:37,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125188642] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:37,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:37,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:43:37,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064901445] [2021-12-14 15:43:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:37,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:43:37,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:43:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:37,443 INFO L87 Difference]: Start difference. First operand 2325 states and 4250 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:38,052 INFO L93 Difference]: Finished difference Result 2695 states and 4778 transitions. [2021-12-14 15:43:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:43:38,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 15:43:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:38,061 INFO L225 Difference]: With dead ends: 2695 [2021-12-14 15:43:38,061 INFO L226 Difference]: Without dead ends: 2500 [2021-12-14 15:43:38,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-14 15:43:38,064 INFO L933 BasicCegarLoop]: 4192 mSDtfsCounter, 4293 mSDsluCounter, 16408 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4303 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:38,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4303 Valid, 20600 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 15:43:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2021-12-14 15:43:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2412. [2021-12-14 15:43:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 2354 states have (on average 1.8254035683942227) internal successors, (4297), 2359 states have internal predecessors, (4297), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (39), 35 states have call predecessors, (39), 34 states have call successors, (39) [2021-12-14 15:43:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 4372 transitions. [2021-12-14 15:43:38,115 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 4372 transitions. Word has length 58 [2021-12-14 15:43:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:38,115 INFO L470 AbstractCegarLoop]: Abstraction has 2412 states and 4372 transitions. [2021-12-14 15:43:38,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 4372 transitions. [2021-12-14 15:43:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:43:38,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:38,117 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-14 15:43:38,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 15:43:38,117 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2021-12-14 15:43:38,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:38,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760568671] [2021-12-14 15:43:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:38,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,188 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-14 15:43:38,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:38,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760568671] [2021-12-14 15:43:38,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760568671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:38,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:38,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 15:43:38,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821934597] [2021-12-14 15:43:38,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:38,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 15:43:38,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:38,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 15:43:38,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:38,190 INFO L87 Difference]: Start difference. First operand 2412 states and 4372 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:38,682 INFO L93 Difference]: Finished difference Result 2976 states and 5174 transitions. [2021-12-14 15:43:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 15:43:38,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 15:43:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:38,692 INFO L225 Difference]: With dead ends: 2976 [2021-12-14 15:43:38,693 INFO L226 Difference]: Without dead ends: 2694 [2021-12-14 15:43:38,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-14 15:43:38,695 INFO L933 BasicCegarLoop]: 4196 mSDtfsCounter, 4237 mSDsluCounter, 16401 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 20597 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:38,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4244 Valid, 20597 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 15:43:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2021-12-14 15:43:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2562. [2021-12-14 15:43:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2475 states have (on average 1.804040404040404) internal successors, (4465), 2482 states have internal predecessors, (4465), 52 states have call successors, (52), 30 states have call predecessors, (52), 33 states have return successors, (63), 53 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-14 15:43:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 4580 transitions. [2021-12-14 15:43:38,750 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 4580 transitions. Word has length 58 [2021-12-14 15:43:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:38,750 INFO L470 AbstractCegarLoop]: Abstraction has 2562 states and 4580 transitions. [2021-12-14 15:43:38,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 4580 transitions. [2021-12-14 15:43:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 15:43:38,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:38,752 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-14 15:43:38,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 15:43:38,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2021-12-14 15:43:38,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:38,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644488703] [2021-12-14 15:43:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:38,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:38,811 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-14 15:43:38,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:38,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644488703] [2021-12-14 15:43:38,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644488703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:38,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:38,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:43:38,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383128915] [2021-12-14 15:43:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:38,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:43:38,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:38,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:43:38,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:43:38,813 INFO L87 Difference]: Start difference. First operand 2562 states and 4580 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:39,220 INFO L93 Difference]: Finished difference Result 3365 states and 5721 transitions. [2021-12-14 15:43:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 15:43:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-14 15:43:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:39,229 INFO L225 Difference]: With dead ends: 3365 [2021-12-14 15:43:39,230 INFO L226 Difference]: Without dead ends: 2934 [2021-12-14 15:43:39,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-14 15:43:39,232 INFO L933 BasicCegarLoop]: 4222 mSDtfsCounter, 4352 mSDsluCounter, 12196 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4375 SdHoareTripleChecker+Valid, 16418 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:39,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4375 Valid, 16418 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 15:43:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2021-12-14 15:43:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2807. [2021-12-14 15:43:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2670 states have (on average 1.7704119850187265) internal successors, (4727), 2682 states have internal predecessors, (4727), 82 states have call successors, (82), 48 states have call predecessors, (82), 53 states have return successors, (97), 80 states have call predecessors, (97), 80 states have call successors, (97) [2021-12-14 15:43:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 4906 transitions. [2021-12-14 15:43:39,294 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 4906 transitions. Word has length 58 [2021-12-14 15:43:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:39,294 INFO L470 AbstractCegarLoop]: Abstraction has 2807 states and 4906 transitions. [2021-12-14 15:43:39,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 15:43:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 4906 transitions. [2021-12-14 15:43:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 15:43:39,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:39,296 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:39,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 15:43:39,296 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2021-12-14 15:43:39,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:39,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005413871] [2021-12-14 15:43:39,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:39,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 15:43:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 15:43:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 15:43:39,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:39,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005413871] [2021-12-14 15:43:39,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005413871] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:39,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52777823] [2021-12-14 15:43:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:39,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:39,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:39,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 15:43:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:39,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:39,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 15:43:39,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:39,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52777823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:39,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:39,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:39,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575155412] [2021-12-14 15:43:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:39,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:39,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:39,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:39,616 INFO L87 Difference]: Start difference. First operand 2807 states and 4906 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:39,676 INFO L93 Difference]: Finished difference Result 4093 states and 6716 transitions. [2021-12-14 15:43:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:39,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-14 15:43:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:39,687 INFO L225 Difference]: With dead ends: 4093 [2021-12-14 15:43:39,688 INFO L226 Difference]: Without dead ends: 3418 [2021-12-14 15:43:39,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:39,691 INFO L933 BasicCegarLoop]: 4226 mSDtfsCounter, 113 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 8333 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:39,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 8333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2021-12-14 15:43:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3418. [2021-12-14 15:43:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 3159 states have (on average 1.7059195948084838) internal successors, (5389), 3178 states have internal predecessors, (5389), 153 states have call successors, (153), 93 states have call predecessors, (153), 104 states have return successors, (206), 154 states have call predecessors, (206), 151 states have call successors, (206) [2021-12-14 15:43:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 5748 transitions. [2021-12-14 15:43:39,832 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 5748 transitions. Word has length 93 [2021-12-14 15:43:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:39,832 INFO L470 AbstractCegarLoop]: Abstraction has 3418 states and 5748 transitions. [2021-12-14 15:43:39,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 5748 transitions. [2021-12-14 15:43:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-14 15:43:39,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:39,836 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:39,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:40,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 15:43:40,054 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2021-12-14 15:43:40,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380242075] [2021-12-14 15:43:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:40,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 15:43:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 15:43:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-14 15:43:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-14 15:43:40,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:40,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380242075] [2021-12-14 15:43:40,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380242075] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:40,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643239229] [2021-12-14 15:43:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:40,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:40,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:40,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:40,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 15:43:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:40,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 15:43:40,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:40,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643239229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:40,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:40,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 15:43:40,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885908875] [2021-12-14 15:43:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:40,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:40,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:40,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:40,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:40,443 INFO L87 Difference]: Start difference. First operand 3418 states and 5748 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 15:43:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:40,546 INFO L93 Difference]: Finished difference Result 5902 states and 9201 transitions. [2021-12-14 15:43:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-14 15:43:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:40,580 INFO L225 Difference]: With dead ends: 5902 [2021-12-14 15:43:40,580 INFO L226 Difference]: Without dead ends: 4619 [2021-12-14 15:43:40,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:40,587 INFO L933 BasicCegarLoop]: 4140 mSDtfsCounter, 4037 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4037 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:40,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4037 Valid, 4271 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2021-12-14 15:43:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4583. [2021-12-14 15:43:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4098 states have (on average 1.6273792093704247) internal successors, (6669), 4132 states have internal predecessors, (6669), 281 states have call successors, (281), 179 states have call predecessors, (281), 202 states have return successors, (372), 279 states have call predecessors, (372), 279 states have call successors, (372) [2021-12-14 15:43:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 7322 transitions. [2021-12-14 15:43:40,719 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 7322 transitions. Word has length 119 [2021-12-14 15:43:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:40,720 INFO L470 AbstractCegarLoop]: Abstraction has 4583 states and 7322 transitions. [2021-12-14 15:43:40,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 15:43:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 7322 transitions. [2021-12-14 15:43:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 15:43:40,727 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:40,727 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:40,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:40,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-14 15:43:40,958 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2021-12-14 15:43:40,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:40,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818233468] [2021-12-14 15:43:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:40,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 15:43:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 15:43:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 15:43:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 15:43:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-14 15:43:41,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:41,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818233468] [2021-12-14 15:43:41,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818233468] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:41,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187714317] [2021-12-14 15:43:41,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:41,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:41,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:41,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:41,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 15:43:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:43:41,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-14 15:43:41,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:41,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187714317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:41,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:41,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:41,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190187055] [2021-12-14 15:43:41,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:41,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:41,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:41,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:41,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:41,337 INFO L87 Difference]: Start difference. First operand 4583 states and 7322 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:43:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:41,444 INFO L93 Difference]: Finished difference Result 6517 states and 9983 transitions. [2021-12-14 15:43:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:41,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2021-12-14 15:43:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:41,472 INFO L225 Difference]: With dead ends: 6517 [2021-12-14 15:43:41,473 INFO L226 Difference]: Without dead ends: 4781 [2021-12-14 15:43:41,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:41,479 INFO L933 BasicCegarLoop]: 4131 mSDtfsCounter, 4058 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 4270 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:41,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4058 Valid, 4270 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2021-12-14 15:43:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4759. [2021-12-14 15:43:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4254 states have (on average 1.6043723554301834) internal successors, (6825), 4288 states have internal predecessors, (6825), 285 states have call successors, (285), 195 states have call predecessors, (285), 218 states have return successors, (392), 283 states have call predecessors, (392), 283 states have call successors, (392) [2021-12-14 15:43:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 7502 transitions. [2021-12-14 15:43:41,608 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 7502 transitions. Word has length 135 [2021-12-14 15:43:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:41,608 INFO L470 AbstractCegarLoop]: Abstraction has 4759 states and 7502 transitions. [2021-12-14 15:43:41,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-14 15:43:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 7502 transitions. [2021-12-14 15:43:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 15:43:41,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:41,615 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:41,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:41,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:41,831 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2021-12-14 15:43:41,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:41,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935644425] [2021-12-14 15:43:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:41,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 15:43:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 15:43:41,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:41,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935644425] [2021-12-14 15:43:41,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935644425] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:41,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722429907] [2021-12-14 15:43:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:41,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:41,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:41,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 15:43:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 15:43:42,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 15:43:42,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:42,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722429907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:42,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:42,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:42,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755928263] [2021-12-14 15:43:42,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:42,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:42,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:42,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:42,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:42,194 INFO L87 Difference]: Start difference. First operand 4759 states and 7502 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:43:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:42,292 INFO L93 Difference]: Finished difference Result 6161 states and 9471 transitions. [2021-12-14 15:43:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:42,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-14 15:43:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:42,305 INFO L225 Difference]: With dead ends: 6161 [2021-12-14 15:43:42,305 INFO L226 Difference]: Without dead ends: 4783 [2021-12-14 15:43:42,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:42,311 INFO L933 BasicCegarLoop]: 4215 mSDtfsCounter, 110 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 8313 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:42,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 8313 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2021-12-14 15:43:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4747. [2021-12-14 15:43:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 4242 states have (on average 1.5933521923620932) internal successors, (6759), 4276 states have internal predecessors, (6759), 285 states have call successors, (285), 195 states have call predecessors, (285), 218 states have return successors, (392), 283 states have call predecessors, (392), 283 states have call successors, (392) [2021-12-14 15:43:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 7436 transitions. [2021-12-14 15:43:42,488 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 7436 transitions. Word has length 136 [2021-12-14 15:43:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:42,489 INFO L470 AbstractCegarLoop]: Abstraction has 4747 states and 7436 transitions. [2021-12-14 15:43:42,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 15:43:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 7436 transitions. [2021-12-14 15:43:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-14 15:43:42,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:42,494 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:42,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:42,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:42,711 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2021-12-14 15:43:42,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:42,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803163251] [2021-12-14 15:43:42,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:42,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 15:43:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 15:43:42,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:42,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803163251] [2021-12-14 15:43:42,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803163251] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:42,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864055483] [2021-12-14 15:43:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:42,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:42,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:42,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:42,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 15:43:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:42,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 15:43:42,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 15:43:43,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:43,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864055483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:43,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:43,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 15:43:43,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643853933] [2021-12-14 15:43:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:43,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 15:43:43,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 15:43:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:43,026 INFO L87 Difference]: Start difference. First operand 4747 states and 7436 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:43:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:43,106 INFO L93 Difference]: Finished difference Result 6943 states and 10430 transitions. [2021-12-14 15:43:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 15:43:43,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2021-12-14 15:43:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:43,116 INFO L225 Difference]: With dead ends: 6943 [2021-12-14 15:43:43,117 INFO L226 Difference]: Without dead ends: 4593 [2021-12-14 15:43:43,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 15:43:43,124 INFO L933 BasicCegarLoop]: 4111 mSDtfsCounter, 4088 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4088 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:43,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4088 Valid, 4135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2021-12-14 15:43:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4455. [2021-12-14 15:43:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 4006 states have (on average 1.5848726909635547) internal successors, (6349), 4032 states have internal predecessors, (6349), 257 states have call successors, (257), 175 states have call predecessors, (257), 190 states have return successors, (310), 251 states have call predecessors, (310), 255 states have call successors, (310) [2021-12-14 15:43:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6916 transitions. [2021-12-14 15:43:43,216 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6916 transitions. Word has length 136 [2021-12-14 15:43:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:43,217 INFO L470 AbstractCegarLoop]: Abstraction has 4455 states and 6916 transitions. [2021-12-14 15:43:43,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 15:43:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6916 transitions. [2021-12-14 15:43:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:43:43,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:43,221 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:43,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:43,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 15:43:43,439 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2021-12-14 15:43:43,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:43,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574517877] [2021-12-14 15:43:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:43,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:43:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 15:43:43,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:43,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574517877] [2021-12-14 15:43:43,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574517877] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:43,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696296235] [2021-12-14 15:43:43,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:43,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:43,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:43,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:43,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 15:43:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:43,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 15:43:43,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 15:43:43,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:43,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696296235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:43,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:43,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 15:43:43,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545298799] [2021-12-14 15:43:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:43,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:43:43,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:43:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 15:43:43,784 INFO L87 Difference]: Start difference. First operand 4455 states and 6916 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:43,983 INFO L93 Difference]: Finished difference Result 6765 states and 9877 transitions. [2021-12-14 15:43:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 15:43:43,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-14 15:43:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:43,994 INFO L225 Difference]: With dead ends: 6765 [2021-12-14 15:43:43,994 INFO L226 Difference]: Without dead ends: 4447 [2021-12-14 15:43:44,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 15:43:44,002 INFO L933 BasicCegarLoop]: 4090 mSDtfsCounter, 4107 mSDsluCounter, 8071 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4115 SdHoareTripleChecker+Valid, 12161 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:44,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4115 Valid, 12161 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:43:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2021-12-14 15:43:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4447. [2021-12-14 15:43:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4447 states, 3998 states have (on average 1.5710355177588795) internal successors, (6281), 4024 states have internal predecessors, (6281), 257 states have call successors, (257), 175 states have call predecessors, (257), 190 states have return successors, (310), 251 states have call predecessors, (310), 255 states have call successors, (310) [2021-12-14 15:43:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6848 transitions. [2021-12-14 15:43:44,103 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6848 transitions. Word has length 137 [2021-12-14 15:43:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:44,103 INFO L470 AbstractCegarLoop]: Abstraction has 4447 states and 6848 transitions. [2021-12-14 15:43:44,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6848 transitions. [2021-12-14 15:43:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:43:44,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:44,107 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:44,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:44,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:44,323 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2021-12-14 15:43:44,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122371406] [2021-12-14 15:43:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:44,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:43:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 15:43:44,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122371406] [2021-12-14 15:43:44,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122371406] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353052981] [2021-12-14 15:43:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:44,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:44,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:44,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 15:43:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:44,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 15:43:44,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 15:43:44,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:44,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353052981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:44,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:44,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 15:43:44,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730021914] [2021-12-14 15:43:44,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:44,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:43:44,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:43:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 15:43:44,677 INFO L87 Difference]: Start difference. First operand 4447 states and 6848 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:44,915 INFO L93 Difference]: Finished difference Result 6530 states and 9508 transitions. [2021-12-14 15:43:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:43:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-14 15:43:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:44,925 INFO L225 Difference]: With dead ends: 6530 [2021-12-14 15:43:44,926 INFO L226 Difference]: Without dead ends: 4511 [2021-12-14 15:43:44,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 15:43:44,932 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8068 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12170 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:44,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4136 Valid, 12170 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:43:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2021-12-14 15:43:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 3795. [2021-12-14 15:43:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-14 15:43:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2021-12-14 15:43:45,040 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2021-12-14 15:43:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:45,040 INFO L470 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2021-12-14 15:43:45,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2021-12-14 15:43:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:43:45,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:45,045 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:45,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:45,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:45,263 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2021-12-14 15:43:45,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:45,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975934061] [2021-12-14 15:43:45,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:45,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:43:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 15:43:45,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:45,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975934061] [2021-12-14 15:43:45,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975934061] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808754836] [2021-12-14 15:43:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:45,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:45,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:45,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:45,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 15:43:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:45,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:43:45,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 15:43:45,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:45,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808754836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:45,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:45,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:43:45,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522024775] [2021-12-14 15:43:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:45,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:43:45,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:45,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:43:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:45,631 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:45,740 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2021-12-14 15:43:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:43:45,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-14 15:43:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:45,747 INFO L225 Difference]: With dead ends: 4934 [2021-12-14 15:43:45,747 INFO L226 Difference]: Without dead ends: 3270 [2021-12-14 15:43:45,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:43:45,753 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:45,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2021-12-14 15:43:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2021-12-14 15:43:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-14 15:43:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2021-12-14 15:43:45,820 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2021-12-14 15:43:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:45,821 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2021-12-14 15:43:45,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2021-12-14 15:43:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:43:45,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:45,823 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:45,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:46,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 15:43:46,035 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2021-12-14 15:43:46,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:46,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989248326] [2021-12-14 15:43:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:46,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:43:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 15:43:46,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989248326] [2021-12-14 15:43:46,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989248326] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 15:43:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781566879] [2021-12-14 15:43:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:46,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 15:43:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 15:43:46,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 15:43:46,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 15:43:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 15:43:46,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 15:43:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 15:43:46,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 15:43:46,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781566879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:46,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 15:43:46,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 15:43:46,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312956242] [2021-12-14 15:43:46,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:46,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:43:46,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:43:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 15:43:46,348 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:46,431 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2021-12-14 15:43:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:43:46,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-14 15:43:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:46,437 INFO L225 Difference]: With dead ends: 4365 [2021-12-14 15:43:46,437 INFO L226 Difference]: Without dead ends: 3262 [2021-12-14 15:43:46,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 15:43:46,441 INFO L933 BasicCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:46,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 15:43:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2021-12-14 15:43:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2021-12-14 15:43:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-14 15:43:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2021-12-14 15:43:46,505 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2021-12-14 15:43:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:46,506 INFO L470 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2021-12-14 15:43:46,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2021-12-14 15:43:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-14 15:43:46,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:46,508 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:46,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 15:43:46,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 15:43:46,723 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:46,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2021-12-14 15:43:46,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:46,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027068522] [2021-12-14 15:43:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:46,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:43:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 15:43:46,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:46,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027068522] [2021-12-14 15:43:46,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027068522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:46,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:46,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 15:43:46,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827005058] [2021-12-14 15:43:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:46,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 15:43:46,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 15:43:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:43:46,819 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 15:43:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:47,217 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2021-12-14 15:43:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 15:43:47,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-14 15:43:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:47,226 INFO L225 Difference]: With dead ends: 4206 [2021-12-14 15:43:47,227 INFO L226 Difference]: Without dead ends: 4203 [2021-12-14 15:43:47,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-14 15:43:47,229 INFO L933 BasicCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12192 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16364 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:47,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4467 Valid, 16364 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 15:43:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2021-12-14 15:43:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2021-12-14 15:43:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-14 15:43:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2021-12-14 15:43:47,311 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2021-12-14 15:43:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:47,311 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2021-12-14 15:43:47,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 15:43:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2021-12-14 15:43:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-14 15:43:47,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:47,314 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:47,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 15:43:47,314 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2021-12-14 15:43:47,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:47,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219134618] [2021-12-14 15:43:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:47,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 15:43:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 15:43:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 15:43:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 15:43:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 15:43:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 15:43:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-14 15:43:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 15:43:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 15:43:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 15:43:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 15:43:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-14 15:43:47,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 15:43:47,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219134618] [2021-12-14 15:43:47,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219134618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 15:43:47,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 15:43:47,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 15:43:47,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913687840] [2021-12-14 15:43:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 15:43:47,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 15:43:47,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 15:43:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 15:43:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 15:43:47,363 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 15:43:47,583 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2021-12-14 15:43:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 15:43:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-14 15:43:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 15:43:47,592 INFO L225 Difference]: With dead ends: 4845 [2021-12-14 15:43:47,592 INFO L226 Difference]: Without dead ends: 3985 [2021-12-14 15:43:47,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 15:43:47,595 INFO L933 BasicCegarLoop]: 4151 mSDtfsCounter, 142 mSDsluCounter, 12166 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 16317 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 15:43:47,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 16317 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 15:43:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2021-12-14 15:43:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2021-12-14 15:43:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-14 15:43:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2021-12-14 15:43:47,675 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2021-12-14 15:43:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 15:43:47,675 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2021-12-14 15:43:47,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-14 15:43:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2021-12-14 15:43:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-14 15:43:47,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 15:43:47,677 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 15:43:47,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 15:43:47,678 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 15:43:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 15:43:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2021-12-14 15:43:47,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 15:43:47,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548700862] [2021-12-14 15:43:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 15:43:47,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 15:43:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:43:47,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 15:43:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 15:43:47,723 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 15:43:47,724 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 15:43:47,724 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-14 15:43:47,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-14 15:43:47,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 15:43:47,728 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 15:43:47,731 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 15:43:47,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:43:47 BoogieIcfgContainer [2021-12-14 15:43:47,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 15:43:47,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 15:43:47,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 15:43:47,845 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 15:43:47,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:43:35" (3/4) ... [2021-12-14 15:43:47,847 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 15:43:47,919 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 15:43:47,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 15:43:47,920 INFO L158 Benchmark]: Toolchain (without parser) took 19620.30ms. Allocated memory was 107.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 67.3MB in the beginning and 663.7MB in the end (delta: -596.4MB). Peak memory consumption was 736.2MB. Max. memory is 16.1GB. [2021-12-14 15:43:47,920 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory was 65.0MB in the beginning and 65.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 15:43:47,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2244.93ms. Allocated memory was 107.0MB in the beginning and 222.3MB in the end (delta: 115.3MB). Free memory was 67.3MB in the beginning and 106.8MB in the end (delta: -39.4MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2021-12-14 15:43:47,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 320.97ms. Allocated memory is still 222.3MB. Free memory was 106.8MB in the beginning and 71.7MB in the end (delta: 35.1MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2021-12-14 15:43:47,921 INFO L158 Benchmark]: Boogie Preprocessor took 314.08ms. Allocated memory was 222.3MB in the beginning and 394.3MB in the end (delta: 172.0MB). Free memory was 71.7MB in the beginning and 212.1MB in the end (delta: -140.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-12-14 15:43:47,921 INFO L158 Benchmark]: RCFGBuilder took 4676.05ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 212.1MB in the beginning and 506.0MB in the end (delta: -293.8MB). Peak memory consumption was 299.7MB. Max. memory is 16.1GB. [2021-12-14 15:43:47,922 INFO L158 Benchmark]: TraceAbstraction took 11984.41ms. Allocated memory was 788.5MB in the beginning and 1.4GB in the end (delta: 652.2MB). Free memory was 506.0MB in the beginning and 682.6MB in the end (delta: -176.6MB). Peak memory consumption was 475.6MB. Max. memory is 16.1GB. [2021-12-14 15:43:47,922 INFO L158 Benchmark]: Witness Printer took 74.72ms. Allocated memory is still 1.4GB. Free memory was 682.6MB in the beginning and 663.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-14 15:43:47,927 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.21ms. Allocated memory is still 107.0MB. Free memory was 65.0MB in the beginning and 65.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2244.93ms. Allocated memory was 107.0MB in the beginning and 222.3MB in the end (delta: 115.3MB). Free memory was 67.3MB in the beginning and 106.8MB in the end (delta: -39.4MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 320.97ms. Allocated memory is still 222.3MB. Free memory was 106.8MB in the beginning and 71.7MB in the end (delta: 35.1MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 314.08ms. Allocated memory was 222.3MB in the beginning and 394.3MB in the end (delta: 172.0MB). Free memory was 71.7MB in the beginning and 212.1MB in the end (delta: -140.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * RCFGBuilder took 4676.05ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 212.1MB in the beginning and 506.0MB in the end (delta: -293.8MB). Peak memory consumption was 299.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11984.41ms. Allocated memory was 788.5MB in the beginning and 1.4GB in the end (delta: 652.2MB). Free memory was 506.0MB in the beginning and 682.6MB in the end (delta: -176.6MB). Peak memory consumption was 475.6MB. Max. memory is 16.1GB. * Witness Printer took 74.72ms. Allocated memory is still 1.4GB. Free memory was 682.6MB in the beginning and 663.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11088]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46791 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46683 mSDsluCounter, 213573 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147127 mSDsCounter, 535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3219 IncrementalHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 535 mSolverCounterUnsat, 66446 mSDtfsCounter, 3219 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1599 GetRequests, 1459 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4759occurred in iteration=8, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 2373 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4618 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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-14 15:43:47,967 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