./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.02.cil.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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:40:47,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:40:47,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:40:47,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:40:47,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:40:47,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:40:47,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:40:47,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:40:47,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:40:47,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:40:47,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:40:47,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:40:47,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:40:47,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:40:47,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:40:47,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:40:47,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:40:47,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:40:47,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:40:47,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:40:47,967 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:40:47,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:40:47,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:40:47,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:40:47,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:40:47,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:40:47,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:40:47,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:40:47,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:40:47,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:40:47,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:40:47,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:40:47,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:40:47,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:40:47,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:40:47,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:40:47,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:40:47,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:40:47,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:40:47,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:40:47,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:40:47,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:40:47,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:40:48,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:40:48,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:40:48,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:40:48,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:40:48,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:40:48,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:40:48,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:40:48,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:40:48,015 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:40:48,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:40:48,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:40:48,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:40:48,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:40:48,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:40:48,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:40:48,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:40:48,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:40:48,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:40:48,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:40:48,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:40:48,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:40:48,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:40:48,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:40:48,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:40:48,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:40:48,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:40:48,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:40:48,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:40:48,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:40:48,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:40:48,020 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:40:48,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:40:48,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:40:48,020 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2022-07-19 17:40:48,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:40:48,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:40:48,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:40:48,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:40:48,211 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:40:48,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-07-19 17:40:48,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f1ccbfc/1091b153149849bda87c609352c3d5cc/FLAGab6add4c0 [2022-07-19 17:40:48,616 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:40:48,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-07-19 17:40:48,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f1ccbfc/1091b153149849bda87c609352c3d5cc/FLAGab6add4c0 [2022-07-19 17:40:49,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f1ccbfc/1091b153149849bda87c609352c3d5cc [2022-07-19 17:40:49,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:40:49,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:40:49,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:40:49,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:40:49,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:40:49,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d14a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49, skipping insertion in model container [2022-07-19 17:40:49,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:40:49,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:40:49,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2022-07-19 17:40:49,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:40:49,302 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:40:49,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2022-07-19 17:40:49,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:40:49,344 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:40:49,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49 WrapperNode [2022-07-19 17:40:49,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:40:49,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:40:49,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:40:49,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:40:49,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,377 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2022-07-19 17:40:49,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:40:49,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:40:49,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:40:49,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:40:49,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:40:49,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:40:49,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:40:49,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:40:49,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (1/1) ... [2022-07-19 17:40:49,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:40:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:40:49,431 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) [2022-07-19 17:40:49,446 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 [2022-07-19 17:40:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:40:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-19 17:40:49,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-19 17:40:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-19 17:40:49,457 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-19 17:40:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-19 17:40:49,457 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-19 17:40:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-19 17:40:49,457 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-19 17:40:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-19 17:40:49,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-19 17:40:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:40:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-19 17:40:49,458 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-19 17:40:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:40:49,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:40:49,505 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:40:49,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:40:49,754 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:40:49,766 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:40:49,766 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 17:40:49,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:40:49 BoogieIcfgContainer [2022-07-19 17:40:49,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:40:49,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:40:49,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:40:49,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:40:49,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:40:49" (1/3) ... [2022-07-19 17:40:49,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a7db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:40:49, skipping insertion in model container [2022-07-19 17:40:49,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:40:49" (2/3) ... [2022-07-19 17:40:49,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a7db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:40:49, skipping insertion in model container [2022-07-19 17:40:49,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:40:49" (3/3) ... [2022-07-19 17:40:49,780 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-07-19 17:40:49,791 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:40:49,791 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:40:49,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:40:49,831 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@377830d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3df1cf7c [2022-07-19 17:40:49,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:40:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 17:40:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:49,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:49,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:49,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2022-07-19 17:40:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:49,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458122240] [2022-07-19 17:40:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:50,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:50,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458122240] [2022-07-19 17:40:50,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458122240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:50,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:50,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:40:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805759668] [2022-07-19 17:40:50,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:50,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:40:50,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:40:50,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:40:50,204 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:50,489 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2022-07-19 17:40:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:40:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:50,498 INFO L225 Difference]: With dead ends: 277 [2022-07-19 17:40:50,498 INFO L226 Difference]: Without dead ends: 153 [2022-07-19 17:40:50,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:40:50,505 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 268 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:50,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:40:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-19 17:40:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2022-07-19 17:40:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 17:40:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2022-07-19 17:40:50,543 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2022-07-19 17:40:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:50,543 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2022-07-19 17:40:50,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2022-07-19 17:40:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:50,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:50,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:50,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:40:50,546 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2022-07-19 17:40:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:50,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132828878] [2022-07-19 17:40:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:50,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132828878] [2022-07-19 17:40:50,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132828878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:50,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:50,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:40:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789661419] [2022-07-19 17:40:50,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:50,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:40:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:50,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:40:50,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:40:50,670 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:51,199 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-07-19 17:40:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:40:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:51,202 INFO L225 Difference]: With dead ends: 406 [2022-07-19 17:40:51,203 INFO L226 Difference]: Without dead ends: 293 [2022-07-19 17:40:51,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:40:51,205 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 377 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:51,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 501 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 17:40:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-19 17:40:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-07-19 17:40:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-19 17:40:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2022-07-19 17:40:51,225 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 67 [2022-07-19 17:40:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:51,225 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2022-07-19 17:40:51,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2022-07-19 17:40:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:51,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:51,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:51,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:40:51,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963514, now seen corresponding path program 1 times [2022-07-19 17:40:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:51,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899657873] [2022-07-19 17:40:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899657873] [2022-07-19 17:40:51,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899657873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:51,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:51,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189911453] [2022-07-19 17:40:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:51,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:51,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:51,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:51,295 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:51,605 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2022-07-19 17:40:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:40:51,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:51,608 INFO L225 Difference]: With dead ends: 516 [2022-07-19 17:40:51,608 INFO L226 Difference]: Without dead ends: 293 [2022-07-19 17:40:51,609 INFO L412 NwaCegarLoop]: 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 [2022-07-19 17:40:51,610 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 279 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:51,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 446 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:40:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-19 17:40:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-07-19 17:40:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-19 17:40:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2022-07-19 17:40:51,627 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 67 [2022-07-19 17:40:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:51,627 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2022-07-19 17:40:51,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-07-19 17:40:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:51,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:51,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:51,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 17:40:51,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1655984776, now seen corresponding path program 1 times [2022-07-19 17:40:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:51,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121657410] [2022-07-19 17:40:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:51,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:51,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121657410] [2022-07-19 17:40:51,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121657410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:51,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:51,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464187248] [2022-07-19 17:40:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:51,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:51,702 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:52,406 INFO L93 Difference]: Finished difference Result 689 states and 986 transitions. [2022-07-19 17:40:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 17:40:52,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:52,409 INFO L225 Difference]: With dead ends: 689 [2022-07-19 17:40:52,409 INFO L226 Difference]: Without dead ends: 466 [2022-07-19 17:40:52,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-19 17:40:52,411 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 384 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:52,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 887 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 17:40:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-07-19 17:40:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 337. [2022-07-19 17:40:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-19 17:40:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 475 transitions. [2022-07-19 17:40:52,430 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 475 transitions. Word has length 67 [2022-07-19 17:40:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:52,430 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 475 transitions. [2022-07-19 17:40:52,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 475 transitions. [2022-07-19 17:40:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:52,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:52,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:52,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 17:40:52,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1212084102, now seen corresponding path program 1 times [2022-07-19 17:40:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612280514] [2022-07-19 17:40:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:52,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:52,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:52,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612280514] [2022-07-19 17:40:52,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612280514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:52,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:52,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138773873] [2022-07-19 17:40:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:52,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:52,492 INFO L87 Difference]: Start difference. First operand 337 states and 475 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:53,152 INFO L93 Difference]: Finished difference Result 1074 states and 1524 transitions. [2022-07-19 17:40:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 17:40:53,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:53,156 INFO L225 Difference]: With dead ends: 1074 [2022-07-19 17:40:53,156 INFO L226 Difference]: Without dead ends: 747 [2022-07-19 17:40:53,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-19 17:40:53,157 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 396 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:53,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 854 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 17:40:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-07-19 17:40:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 544. [2022-07-19 17:40:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-19 17:40:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 768 transitions. [2022-07-19 17:40:53,184 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 768 transitions. Word has length 67 [2022-07-19 17:40:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:53,185 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 768 transitions. [2022-07-19 17:40:53,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 768 transitions. [2022-07-19 17:40:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:53,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:53,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:53,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 17:40:53,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1054297084, now seen corresponding path program 1 times [2022-07-19 17:40:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44255631] [2022-07-19 17:40:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:53,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44255631] [2022-07-19 17:40:53,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44255631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:53,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:53,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208077059] [2022-07-19 17:40:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:53,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:53,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:53,266 INFO L87 Difference]: Start difference. First operand 544 states and 768 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:53,707 INFO L93 Difference]: Finished difference Result 1203 states and 1727 transitions. [2022-07-19 17:40:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 17:40:53,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:53,717 INFO L225 Difference]: With dead ends: 1203 [2022-07-19 17:40:53,717 INFO L226 Difference]: Without dead ends: 670 [2022-07-19 17:40:53,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:40:53,719 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:53,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 580 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:40:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-19 17:40:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 547. [2022-07-19 17:40:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-19 17:40:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 767 transitions. [2022-07-19 17:40:53,748 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 767 transitions. Word has length 67 [2022-07-19 17:40:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:53,748 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 767 transitions. [2022-07-19 17:40:53,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 767 transitions. [2022-07-19 17:40:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:53,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:53,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:53,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 17:40:53,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1302443578, now seen corresponding path program 1 times [2022-07-19 17:40:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:53,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204620326] [2022-07-19 17:40:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:53,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:53,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:53,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204620326] [2022-07-19 17:40:53,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204620326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:53,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:53,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059173193] [2022-07-19 17:40:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:53,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:53,835 INFO L87 Difference]: Start difference. First operand 547 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:54,257 INFO L93 Difference]: Finished difference Result 1269 states and 1814 transitions. [2022-07-19 17:40:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 17:40:54,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:54,261 INFO L225 Difference]: With dead ends: 1269 [2022-07-19 17:40:54,261 INFO L226 Difference]: Without dead ends: 733 [2022-07-19 17:40:54,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-19 17:40:54,263 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:54,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 569 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:40:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-07-19 17:40:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 562. [2022-07-19 17:40:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-19 17:40:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2022-07-19 17:40:54,288 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2022-07-19 17:40:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2022-07-19 17:40:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2022-07-19 17:40:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 17:40:54,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:54,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:54,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 17:40:54,290 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash 908076792, now seen corresponding path program 1 times [2022-07-19 17:40:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:54,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20077821] [2022-07-19 17:40:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:54,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:54,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20077821] [2022-07-19 17:40:54,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20077821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:54,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:54,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541149080] [2022-07-19 17:40:54,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:54,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:54,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:54,363 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:55,256 INFO L93 Difference]: Finished difference Result 2996 states and 4324 transitions. [2022-07-19 17:40:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 17:40:55,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-19 17:40:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:55,266 INFO L225 Difference]: With dead ends: 2996 [2022-07-19 17:40:55,266 INFO L226 Difference]: Without dead ends: 2445 [2022-07-19 17:40:55,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-19 17:40:55,269 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 1008 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:55,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 848 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 17:40:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-07-19 17:40:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1559. [2022-07-19 17:40:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-07-19 17:40:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2171 transitions. [2022-07-19 17:40:55,380 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2171 transitions. Word has length 67 [2022-07-19 17:40:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:55,380 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2171 transitions. [2022-07-19 17:40:55,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2171 transitions. [2022-07-19 17:40:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 17:40:55,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:55,382 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 17:40:55,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:40:55,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:55,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash 918077039, now seen corresponding path program 1 times [2022-07-19 17:40:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:55,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796595006] [2022-07-19 17:40:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:55,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:40:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 17:40:55,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:55,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796595006] [2022-07-19 17:40:55,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796595006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:55,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:55,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:55,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293012901] [2022-07-19 17:40:55,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:55,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:55,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:55,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:55,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:55,440 INFO L87 Difference]: Start difference. First operand 1559 states and 2171 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:55,921 INFO L93 Difference]: Finished difference Result 3474 states and 4944 transitions. [2022-07-19 17:40:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 17:40:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-07-19 17:40:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:55,930 INFO L225 Difference]: With dead ends: 3474 [2022-07-19 17:40:55,930 INFO L226 Difference]: Without dead ends: 1926 [2022-07-19 17:40:55,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-19 17:40:55,935 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 171 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:55,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 569 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:40:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-07-19 17:40:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1589. [2022-07-19 17:40:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-07-19 17:40:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2196 transitions. [2022-07-19 17:40:56,025 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2196 transitions. Word has length 84 [2022-07-19 17:40:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:56,026 INFO L495 AbstractCegarLoop]: Abstraction has 1589 states and 2196 transitions. [2022-07-19 17:40:56,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2196 transitions. [2022-07-19 17:40:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 17:40:56,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:56,028 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 17:40:56,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 17:40:56,028 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2022-07-19 17:40:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:56,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576084739] [2022-07-19 17:40:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:40:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 17:40:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:56,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576084739] [2022-07-19 17:40:56,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576084739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:56,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:56,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829198783] [2022-07-19 17:40:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:56,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:56,111 INFO L87 Difference]: Start difference. First operand 1589 states and 2196 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:56,433 INFO L93 Difference]: Finished difference Result 3422 states and 4752 transitions. [2022-07-19 17:40:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:40:56,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-07-19 17:40:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:56,440 INFO L225 Difference]: With dead ends: 3422 [2022-07-19 17:40:56,441 INFO L226 Difference]: Without dead ends: 1845 [2022-07-19 17:40:56,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:40:56,446 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 326 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:56,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 415 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:40:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-07-19 17:40:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1577. [2022-07-19 17:40:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-07-19 17:40:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2148 transitions. [2022-07-19 17:40:56,544 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2148 transitions. Word has length 84 [2022-07-19 17:40:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:56,545 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2148 transitions. [2022-07-19 17:40:56,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2148 transitions. [2022-07-19 17:40:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 17:40:56,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:56,547 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 17:40:56,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 17:40:56,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2022-07-19 17:40:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:56,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769673611] [2022-07-19 17:40:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:40:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 17:40:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769673611] [2022-07-19 17:40:56,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769673611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:56,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:56,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 17:40:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077457818] [2022-07-19 17:40:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:56,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 17:40:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 17:40:56,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:40:56,610 INFO L87 Difference]: Start difference. First operand 1577 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:57,318 INFO L93 Difference]: Finished difference Result 2572 states and 3512 transitions. [2022-07-19 17:40:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 17:40:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-07-19 17:40:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:57,325 INFO L225 Difference]: With dead ends: 2572 [2022-07-19 17:40:57,325 INFO L226 Difference]: Without dead ends: 1597 [2022-07-19 17:40:57,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-07-19 17:40:57,328 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 485 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:57,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 656 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 17:40:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-07-19 17:40:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1258. [2022-07-19 17:40:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-07-19 17:40:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1691 transitions. [2022-07-19 17:40:57,395 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1691 transitions. Word has length 84 [2022-07-19 17:40:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:57,395 INFO L495 AbstractCegarLoop]: Abstraction has 1258 states and 1691 transitions. [2022-07-19 17:40:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1691 transitions. [2022-07-19 17:40:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 17:40:57,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:57,397 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 17:40:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 17:40:57,397 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2022-07-19 17:40:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078373391] [2022-07-19 17:40:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:57,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:57,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:57,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:57,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:40:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 17:40:57,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:57,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078373391] [2022-07-19 17:40:57,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078373391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:57,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:57,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 17:40:57,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914726162] [2022-07-19 17:40:57,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:57,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 17:40:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:57,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 17:40:57,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:40:57,458 INFO L87 Difference]: Start difference. First operand 1258 states and 1691 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:58,128 INFO L93 Difference]: Finished difference Result 2777 states and 3732 transitions. [2022-07-19 17:40:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 17:40:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-07-19 17:40:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:58,135 INFO L225 Difference]: With dead ends: 2777 [2022-07-19 17:40:58,135 INFO L226 Difference]: Without dead ends: 1622 [2022-07-19 17:40:58,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-07-19 17:40:58,139 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 610 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:58,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 593 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 17:40:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-07-19 17:40:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1246. [2022-07-19 17:40:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-07-19 17:40:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1667 transitions. [2022-07-19 17:40:58,227 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1667 transitions. Word has length 84 [2022-07-19 17:40:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:58,228 INFO L495 AbstractCegarLoop]: Abstraction has 1246 states and 1667 transitions. [2022-07-19 17:40:58,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:40:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1667 transitions. [2022-07-19 17:40:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 17:40:58,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:58,229 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 17:40:58,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 17:40:58,229 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:58,230 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2022-07-19 17:40:58,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:58,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100129697] [2022-07-19 17:40:58,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:58,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:40:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 17:40:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:58,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100129697] [2022-07-19 17:40:58,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100129697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:40:58,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215212823] [2022-07-19 17:40:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:58,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:40:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:40:58,305 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) [2022-07-19 17:40:58,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 17:40:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:40:58,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:40:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:40:58,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:40:58,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215212823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:58,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:40:58,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-19 17:40:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231080270] [2022-07-19 17:40:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:58,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:40:58,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:40:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:58,424 INFO L87 Difference]: Start difference. First operand 1246 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:40:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:58,605 INFO L93 Difference]: Finished difference Result 2883 states and 3926 transitions. [2022-07-19 17:40:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:40:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2022-07-19 17:40:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:58,611 INFO L225 Difference]: With dead ends: 2883 [2022-07-19 17:40:58,611 INFO L226 Difference]: Without dead ends: 2039 [2022-07-19 17:40:58,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:58,614 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 129 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:58,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 474 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:40:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-07-19 17:40:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2022-07-19 17:40:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-07-19 17:40:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2750 transitions. [2022-07-19 17:40:58,708 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2750 transitions. Word has length 84 [2022-07-19 17:40:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:58,709 INFO L495 AbstractCegarLoop]: Abstraction has 2039 states and 2750 transitions. [2022-07-19 17:40:58,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:40:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2022-07-19 17:40:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-19 17:40:58,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:58,711 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:58,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 17:40:58,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 17:40:58,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2022-07-19 17:40:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:58,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251413242] [2022-07-19 17:40:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:40:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:40:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 17:40:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:59,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251413242] [2022-07-19 17:40:59,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251413242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:59,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:59,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:40:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271604872] [2022-07-19 17:40:59,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:59,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:40:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:59,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:40:59,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:40:59,003 INFO L87 Difference]: Start difference. First operand 2039 states and 2750 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 17:40:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:40:59,570 INFO L93 Difference]: Finished difference Result 6620 states and 9061 transitions. [2022-07-19 17:40:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:40:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-07-19 17:40:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:40:59,589 INFO L225 Difference]: With dead ends: 6620 [2022-07-19 17:40:59,590 INFO L226 Difference]: Without dead ends: 4593 [2022-07-19 17:40:59,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:40:59,596 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 611 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:40:59,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 501 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:40:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-07-19 17:40:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4197. [2022-07-19 17:40:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-07-19 17:40:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 5702 transitions. [2022-07-19 17:40:59,884 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 5702 transitions. Word has length 99 [2022-07-19 17:40:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:40:59,885 INFO L495 AbstractCegarLoop]: Abstraction has 4197 states and 5702 transitions. [2022-07-19 17:40:59,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 17:40:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 5702 transitions. [2022-07-19 17:40:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-19 17:40:59,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:40:59,887 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:40:59,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 17:40:59,887 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:40:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:40:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2022-07-19 17:40:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:40:59,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564491338] [2022-07-19 17:40:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:40:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:40:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:40:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:40:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:40:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:40:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:40:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:40:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:40:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:40:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 17:40:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:40:59,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564491338] [2022-07-19 17:40:59,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564491338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:40:59,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:40:59,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:40:59,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126595537] [2022-07-19 17:40:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:40:59,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:40:59,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:40:59,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:40:59,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:40:59,937 INFO L87 Difference]: Start difference. First operand 4197 states and 5702 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 17:41:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:00,351 INFO L93 Difference]: Finished difference Result 8948 states and 12144 transitions. [2022-07-19 17:41:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:41:00,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-07-19 17:41:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:00,367 INFO L225 Difference]: With dead ends: 8948 [2022-07-19 17:41:00,367 INFO L226 Difference]: Without dead ends: 4762 [2022-07-19 17:41:00,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:41:00,377 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 323 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:00,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 266 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:41:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2022-07-19 17:41:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 4192. [2022-07-19 17:41:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4192 states, 3531 states have (on average 1.3101104502973662) internal successors, (4626), 3584 states have internal predecessors, (4626), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2022-07-19 17:41:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 5692 transitions. [2022-07-19 17:41:00,640 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 5692 transitions. Word has length 99 [2022-07-19 17:41:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:00,640 INFO L495 AbstractCegarLoop]: Abstraction has 4192 states and 5692 transitions. [2022-07-19 17:41:00,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 17:41:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 5692 transitions. [2022-07-19 17:41:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 17:41:00,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:00,642 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:41:00,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 17:41:00,642 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1243137275, now seen corresponding path program 1 times [2022-07-19 17:41:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:00,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282731662] [2022-07-19 17:41:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:41:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 17:41:00,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:00,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282731662] [2022-07-19 17:41:00,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282731662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:00,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:41:00,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:41:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2528680] [2022-07-19 17:41:00,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:00,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:41:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:41:00,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:41:00,701 INFO L87 Difference]: Start difference. First operand 4192 states and 5692 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 17:41:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:01,331 INFO L93 Difference]: Finished difference Result 9970 states and 13687 transitions. [2022-07-19 17:41:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:41:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2022-07-19 17:41:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:01,356 INFO L225 Difference]: With dead ends: 9970 [2022-07-19 17:41:01,356 INFO L226 Difference]: Without dead ends: 6565 [2022-07-19 17:41:01,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:41:01,367 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 417 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:01,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 352 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:41:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2022-07-19 17:41:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 5725. [2022-07-19 17:41:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5725 states, 4816 states have (on average 1.3054401993355482) internal successors, (6287), 4881 states have internal predecessors, (6287), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2022-07-19 17:41:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 7714 transitions. [2022-07-19 17:41:01,771 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 7714 transitions. Word has length 100 [2022-07-19 17:41:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:01,771 INFO L495 AbstractCegarLoop]: Abstraction has 5725 states and 7714 transitions. [2022-07-19 17:41:01,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 17:41:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 7714 transitions. [2022-07-19 17:41:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 17:41:01,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:01,775 INFO L195 NwaCegarLoop]: 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, 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] [2022-07-19 17:41:01,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 17:41:01,776 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1869458483, now seen corresponding path program 1 times [2022-07-19 17:41:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167657531] [2022-07-19 17:41:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 17:41:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:41:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 17:41:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:01,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167657531] [2022-07-19 17:41:01,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167657531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:41:01,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144325821] [2022-07-19 17:41:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:01,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:41:01,848 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) [2022-07-19 17:41:01,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 17:41:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:01,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:41:01,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:41:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 17:41:01,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:41:01,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144325821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:01,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:41:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-07-19 17:41:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59981760] [2022-07-19 17:41:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:41:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:41:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:41:01,996 INFO L87 Difference]: Start difference. First operand 5725 states and 7714 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 17:41:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:02,359 INFO L93 Difference]: Finished difference Result 13443 states and 18129 transitions. [2022-07-19 17:41:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:41:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-07-19 17:41:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:02,382 INFO L225 Difference]: With dead ends: 13443 [2022-07-19 17:41:02,382 INFO L226 Difference]: Without dead ends: 7715 [2022-07-19 17:41:02,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:41:02,395 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 86 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 368 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 [2022-07-19 17:41:02,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 368 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:41:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2022-07-19 17:41:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7649. [2022-07-19 17:41:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 6430 states have (on average 1.3021772939346812) internal successors, (8373), 6510 states have internal predecessors, (8373), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2022-07-19 17:41:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 10209 transitions. [2022-07-19 17:41:02,888 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 10209 transitions. Word has length 117 [2022-07-19 17:41:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:02,888 INFO L495 AbstractCegarLoop]: Abstraction has 7649 states and 10209 transitions. [2022-07-19 17:41:02,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 17:41:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 10209 transitions. [2022-07-19 17:41:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 17:41:02,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:02,891 INFO L195 NwaCegarLoop]: 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, 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] [2022-07-19 17:41:02,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:41:03,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 17:41:03,107 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 964798723, now seen corresponding path program 1 times [2022-07-19 17:41:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:03,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795725621] [2022-07-19 17:41:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 17:41:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:41:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 17:41:03,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795725621] [2022-07-19 17:41:03,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795725621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:41:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315824669] [2022-07-19 17:41:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:03,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:03,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:41:03,204 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) [2022-07-19 17:41:03,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 17:41:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:03,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:41:03,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:41:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 17:41:03,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:41:03,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315824669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:03,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:41:03,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-19 17:41:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951984718] [2022-07-19 17:41:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:03,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:41:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:41:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:41:03,345 INFO L87 Difference]: Start difference. First operand 7649 states and 10209 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 17:41:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:03,874 INFO L93 Difference]: Finished difference Result 16201 states and 22003 transitions. [2022-07-19 17:41:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:41:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-07-19 17:41:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:03,898 INFO L225 Difference]: With dead ends: 16201 [2022-07-19 17:41:03,898 INFO L226 Difference]: Without dead ends: 9348 [2022-07-19 17:41:03,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:41:03,914 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 121 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:03,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:41:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9348 states. [2022-07-19 17:41:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9348 to 9241. [2022-07-19 17:41:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 7848 states have (on average 1.2719164118246686) internal successors, (9982), 7944 states have internal predecessors, (9982), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2022-07-19 17:41:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 12120 transitions. [2022-07-19 17:41:04,509 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 12120 transitions. Word has length 118 [2022-07-19 17:41:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:04,509 INFO L495 AbstractCegarLoop]: Abstraction has 9241 states and 12120 transitions. [2022-07-19 17:41:04,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 17:41:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 12120 transitions. [2022-07-19 17:41:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 17:41:04,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:04,512 INFO L195 NwaCegarLoop]: 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, 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] [2022-07-19 17:41:04,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 17:41:04,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 17:41:04,730 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash -36607372, now seen corresponding path program 1 times [2022-07-19 17:41:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:04,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043723460] [2022-07-19 17:41:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 17:41:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:41:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 17:41:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:04,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043723460] [2022-07-19 17:41:04,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043723460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:41:04,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895116962] [2022-07-19 17:41:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:04,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:04,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:41:04,806 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) [2022-07-19 17:41:04,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 17:41:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:04,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 17:41:04,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:41:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:41:04,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:41:04,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895116962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:04,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:41:04,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-19 17:41:04,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182774518] [2022-07-19 17:41:04,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:04,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:41:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:04,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:41:04,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:41:04,897 INFO L87 Difference]: Start difference. First operand 9241 states and 12120 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 17:41:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:05,457 INFO L93 Difference]: Finished difference Result 16957 states and 22181 transitions. [2022-07-19 17:41:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:41:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2022-07-19 17:41:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:05,486 INFO L225 Difference]: With dead ends: 16957 [2022-07-19 17:41:05,486 INFO L226 Difference]: Without dead ends: 9930 [2022-07-19 17:41:05,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:41:05,500 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:05,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:41:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2022-07-19 17:41:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 9843. [2022-07-19 17:41:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 8423 states have (on average 1.2614270449958447) internal successors, (10625), 8525 states have internal predecessors, (10625), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2022-07-19 17:41:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12655 transitions. [2022-07-19 17:41:06,162 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12655 transitions. Word has length 121 [2022-07-19 17:41:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:06,163 INFO L495 AbstractCegarLoop]: Abstraction has 9843 states and 12655 transitions. [2022-07-19 17:41:06,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 17:41:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12655 transitions. [2022-07-19 17:41:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 17:41:06,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:06,168 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2022-07-19 17:41:06,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 17:41:06,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:06,386 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:06,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1792814822, now seen corresponding path program 1 times [2022-07-19 17:41:06,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:06,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379254051] [2022-07-19 17:41:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:06,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 17:41:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 17:41:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 17:41:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 17:41:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:06,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379254051] [2022-07-19 17:41:06,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379254051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:41:06,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811697844] [2022-07-19 17:41:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:06,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:41:06,472 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) [2022-07-19 17:41:06,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 17:41:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:06,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:41:06,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:41:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:41:06,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:41:06,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811697844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:06,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:41:06,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-19 17:41:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509643629] [2022-07-19 17:41:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:06,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:41:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:41:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:41:06,561 INFO L87 Difference]: Start difference. First operand 9843 states and 12655 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 17:41:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:07,761 INFO L93 Difference]: Finished difference Result 28741 states and 37387 transitions. [2022-07-19 17:41:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:41:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 153 [2022-07-19 17:41:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:07,812 INFO L225 Difference]: With dead ends: 28741 [2022-07-19 17:41:07,812 INFO L226 Difference]: Without dead ends: 18910 [2022-07-19 17:41:07,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:41:07,833 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 147 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:07,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:41:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2022-07-19 17:41:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18895. [2022-07-19 17:41:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18895 states, 16195 states have (on average 1.250077184316147) internal successors, (20245), 16388 states have internal predecessors, (20245), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-07-19 17:41:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18895 states to 18895 states and 24374 transitions. [2022-07-19 17:41:09,087 INFO L78 Accepts]: Start accepts. Automaton has 18895 states and 24374 transitions. Word has length 153 [2022-07-19 17:41:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:09,088 INFO L495 AbstractCegarLoop]: Abstraction has 18895 states and 24374 transitions. [2022-07-19 17:41:09,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 17:41:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18895 states and 24374 transitions. [2022-07-19 17:41:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-19 17:41:09,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:09,100 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1] [2022-07-19 17:41:09,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 17:41:09,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:09,335 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2022-07-19 17:41:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:09,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531216695] [2022-07-19 17:41:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:41:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:41:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 17:41:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-19 17:41:09,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:09,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531216695] [2022-07-19 17:41:09,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531216695] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:41:09,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857237787] [2022-07-19 17:41:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:09,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:09,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:41:09,390 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) [2022-07-19 17:41:09,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 17:41:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:09,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:41:09,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:41:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:41:09,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:41:09,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857237787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:09,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:41:09,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-19 17:41:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287749259] [2022-07-19 17:41:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:09,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:41:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:41:09,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:41:09,496 INFO L87 Difference]: Start difference. First operand 18895 states and 24374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:41:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:10,522 INFO L93 Difference]: Finished difference Result 29234 states and 38669 transitions. [2022-07-19 17:41:10,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:41:10,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 154 [2022-07-19 17:41:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:10,570 INFO L225 Difference]: With dead ends: 29234 [2022-07-19 17:41:10,571 INFO L226 Difference]: Without dead ends: 18527 [2022-07-19 17:41:10,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:41:10,591 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:10,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:41:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18527 states. [2022-07-19 17:41:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18527 to 18465. [2022-07-19 17:41:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 15765 states have (on average 1.238883602917856) internal successors, (19531), 15958 states have internal predecessors, (19531), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-07-19 17:41:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 23660 transitions. [2022-07-19 17:41:11,738 INFO L78 Accepts]: Start accepts. Automaton has 18465 states and 23660 transitions. Word has length 154 [2022-07-19 17:41:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:11,739 INFO L495 AbstractCegarLoop]: Abstraction has 18465 states and 23660 transitions. [2022-07-19 17:41:11,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 17:41:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18465 states and 23660 transitions. [2022-07-19 17:41:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 17:41:11,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:11,747 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2022-07-19 17:41:11,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 17:41:11,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:11,964 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2022-07-19 17:41:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:11,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815183397] [2022-07-19 17:41:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:41:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:41:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 17:41:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 17:41:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:12,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815183397] [2022-07-19 17:41:12,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815183397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:12,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:41:12,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:41:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794757839] [2022-07-19 17:41:12,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:12,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:41:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:41:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:41:12,025 INFO L87 Difference]: Start difference. First operand 18465 states and 23660 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 17:41:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:13,564 INFO L93 Difference]: Finished difference Result 33725 states and 43529 transitions. [2022-07-19 17:41:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:41:13,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2022-07-19 17:41:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:13,615 INFO L225 Difference]: With dead ends: 33725 [2022-07-19 17:41:13,616 INFO L226 Difference]: Without dead ends: 17956 [2022-07-19 17:41:13,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:41:13,651 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 561 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:13,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 586 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:41:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2022-07-19 17:41:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 16098. [2022-07-19 17:41:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16098 states, 13792 states have (on average 1.2261455916473318) internal successors, (16911), 13972 states have internal predecessors, (16911), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-07-19 17:41:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16098 states to 16098 states and 20177 transitions. [2022-07-19 17:41:14,825 INFO L78 Accepts]: Start accepts. Automaton has 16098 states and 20177 transitions. Word has length 155 [2022-07-19 17:41:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:14,826 INFO L495 AbstractCegarLoop]: Abstraction has 16098 states and 20177 transitions. [2022-07-19 17:41:14,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 17:41:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 16098 states and 20177 transitions. [2022-07-19 17:41:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 17:41:14,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:14,832 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2022-07-19 17:41:14,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 17:41:14,832 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2022-07-19 17:41:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595437835] [2022-07-19 17:41:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:41:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:41:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 17:41:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 17:41:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595437835] [2022-07-19 17:41:14,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595437835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:41:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119834236] [2022-07-19 17:41:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:14,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:14,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:41:14,886 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) [2022-07-19 17:41:14,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 17:41:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:14,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 17:41:14,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:41:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 17:41:15,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:41:15,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119834236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:15,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:41:15,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-19 17:41:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695765269] [2022-07-19 17:41:15,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:41:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:41:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:41:15,029 INFO L87 Difference]: Start difference. First operand 16098 states and 20177 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:41:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:15,913 INFO L93 Difference]: Finished difference Result 28643 states and 36407 transitions. [2022-07-19 17:41:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:41:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2022-07-19 17:41:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:15,955 INFO L225 Difference]: With dead ends: 28643 [2022-07-19 17:41:15,955 INFO L226 Difference]: Without dead ends: 16151 [2022-07-19 17:41:15,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:41:15,978 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 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 [2022-07-19 17:41:15,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:41:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2022-07-19 17:41:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 16082. [2022-07-19 17:41:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 13776 states have (on average 1.2047038327526132) internal successors, (16596), 13956 states have internal predecessors, (16596), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-07-19 17:41:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 19862 transitions. [2022-07-19 17:41:16,999 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 19862 transitions. Word has length 156 [2022-07-19 17:41:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:16,999 INFO L495 AbstractCegarLoop]: Abstraction has 16082 states and 19862 transitions. [2022-07-19 17:41:17,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:41:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 19862 transitions. [2022-07-19 17:41:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 17:41:17,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:17,007 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2022-07-19 17:41:17,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-19 17:41:17,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:41:17,224 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2022-07-19 17:41:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900178721] [2022-07-19 17:41:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:41:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:41:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 17:41:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:41:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:41:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 17:41:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:41:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 17:41:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 17:41:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:41:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-19 17:41:17,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:41:17,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900178721] [2022-07-19 17:41:17,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900178721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:41:17,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:41:17,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 17:41:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300657544] [2022-07-19 17:41:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:41:17,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 17:41:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:41:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 17:41:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:41:17,304 INFO L87 Difference]: Start difference. First operand 16082 states and 19862 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 17:41:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:41:19,525 INFO L93 Difference]: Finished difference Result 40643 states and 51929 transitions. [2022-07-19 17:41:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 17:41:19,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2022-07-19 17:41:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:41:19,589 INFO L225 Difference]: With dead ends: 40643 [2022-07-19 17:41:19,589 INFO L226 Difference]: Without dead ends: 24579 [2022-07-19 17:41:19,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:41:19,620 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 912 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:41:19,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 504 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 17:41:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2022-07-19 17:41:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 23029. [2022-07-19 17:41:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23029 states, 19688 states have (on average 1.1473994311255586) internal successors, (22590), 20035 states have internal predecessors, (22590), 1643 states have call successors, (1643), 1326 states have call predecessors, (1643), 1697 states have return successors, (3030), 1669 states have call predecessors, (3030), 1643 states have call successors, (3030) [2022-07-19 17:41:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 27263 transitions. [2022-07-19 17:41:21,204 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 27263 transitions. Word has length 156 [2022-07-19 17:41:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:41:21,204 INFO L495 AbstractCegarLoop]: Abstraction has 23029 states and 27263 transitions. [2022-07-19 17:41:21,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-19 17:41:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 27263 transitions. [2022-07-19 17:41:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-19 17:41:21,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:41:21,212 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1] [2022-07-19 17:41:21,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 17:41:21,212 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:41:21,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:41:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2022-07-19 17:41:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:41:21,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879837509] [2022-07-19 17:41:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:41:21,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:41:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:41:21,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 17:41:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:41:21,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 17:41:21,273 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 17:41:21,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:41:21,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 17:41:21,277 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:41:21,280 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:41:21,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:41:21 BoogieIcfgContainer [2022-07-19 17:41:21,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:41:21,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:41:21,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:41:21,395 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:41:21,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:40:49" (3/4) ... [2022-07-19 17:41:21,397 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 17:41:21,491 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:41:21,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:41:21,491 INFO L158 Benchmark]: Toolchain (without parser) took 32428.37ms. Allocated memory was 127.9MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 92.2MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 520.2MB. Max. memory is 16.1GB. [2022-07-19 17:41:21,492 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 39.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:41:21,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.73ms. Allocated memory is still 127.9MB. Free memory was 92.0MB in the beginning and 98.2MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 17:41:21,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.96ms. Allocated memory is still 127.9MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:41:21,493 INFO L158 Benchmark]: Boogie Preprocessor took 18.36ms. Allocated memory is still 127.9MB. Free memory was 96.1MB in the beginning and 94.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:41:21,493 INFO L158 Benchmark]: RCFGBuilder took 371.03ms. Allocated memory is still 127.9MB. Free memory was 94.5MB in the beginning and 77.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 17:41:21,493 INFO L158 Benchmark]: TraceAbstraction took 31625.24ms. Allocated memory was 127.9MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 77.2MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 493.8MB. Max. memory is 16.1GB. [2022-07-19 17:41:21,494 INFO L158 Benchmark]: Witness Printer took 96.18ms. Allocated memory is still 6.1GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 17:41:21,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 39.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.73ms. Allocated memory is still 127.9MB. Free memory was 92.0MB in the beginning and 98.2MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.96ms. Allocated memory is still 127.9MB. Free memory was 98.2MB in the beginning and 96.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.36ms. Allocated memory is still 127.9MB. Free memory was 96.1MB in the beginning and 94.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 371.03ms. Allocated memory is still 127.9MB. Free memory was 94.5MB in the beginning and 77.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31625.24ms. Allocated memory was 127.9MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 77.2MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 493.8MB. Max. memory is 16.1GB. * Witness Printer took 96.18ms. Allocated memory is still 6.1GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.5s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8635 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8448 mSDsluCounter, 12182 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7022 mSDsCounter, 1514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8818 IncrementalHoareTripleChecker+Invalid, 10332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1514 mSolverCounterUnsat, 5160 mSDtfsCounter, 8818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1550 GetRequests, 1299 SyntacticMatches, 2 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23029occurred in iteration=24, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 8602 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3444 NumberOfCodeBlocks, 3444 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2763 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 865/990 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! [2022-07-19 17:41:21,549 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