./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:14:04,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:14:04,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:14:04,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:14:04,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:14:04,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:14:04,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:14:04,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:14:04,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:14:04,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:14:04,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:14:04,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:14:04,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:14:04,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:14:04,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:14:04,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:14:04,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:14:04,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:14:04,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:14:04,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:14:04,430 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:14:04,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:14:04,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:14:04,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:14:04,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:14:04,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:14:04,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:14:04,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:14:04,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:14:04,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:14:04,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:14:04,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:14:04,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:14:04,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:14:04,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:14:04,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:14:04,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:14:04,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:14:04,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:14:04,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:14:04,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:14:04,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:14:04,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:14:04,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:14:04,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:14:04,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:14:04,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:14:04,496 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:14:04,496 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:14:04,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:14:04,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:14:04,497 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:14:04,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:14:04,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:14:04,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:14:04,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:14:04,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:14:04,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:14:04,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:14:04,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:14:04,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:14:04,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:14:04,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:14:04,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:14:04,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:14:04,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:14:04,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:14:04,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:14:04,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:14:04,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:14:04,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:14:04,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:14:04,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:14:04,502 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:14:04,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:14:04,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:14:04,503 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2022-07-21 05:14:04,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:14:04,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:14:04,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:14:04,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:14:04,840 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:14:04,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-07-21 05:14:04,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66fc569a/3e875dadcea341008304135337295b40/FLAG1b1fb9ed3 [2022-07-21 05:14:05,346 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:14:05,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-07-21 05:14:05,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66fc569a/3e875dadcea341008304135337295b40/FLAG1b1fb9ed3 [2022-07-21 05:14:05,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66fc569a/3e875dadcea341008304135337295b40 [2022-07-21 05:14:05,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:14:05,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:14:05,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:14:05,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:14:05,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:14:05,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:14:05" (1/1) ... [2022-07-21 05:14:05,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1bac9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:05, skipping insertion in model container [2022-07-21 05:14:05,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:14:05" (1/1) ... [2022-07-21 05:14:05,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:14:05,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:14:05,925 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/token_ring.01.cil-2.c[671,684] [2022-07-21 05:14:06,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:14:06,010 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:14:06,025 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/token_ring.01.cil-2.c[671,684] [2022-07-21 05:14:06,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:14:06,089 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:14:06,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06 WrapperNode [2022-07-21 05:14:06,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:14:06,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:14:06,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:14:06,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:14:06,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,144 INFO L137 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 220 [2022-07-21 05:14:06,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:14:06,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:14:06,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:14:06,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:14:06,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:14:06,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:14:06,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:14:06,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:14:06,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (1/1) ... [2022-07-21 05:14:06,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:14:06,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:06,230 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-21 05:14:06,255 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-21 05:14:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:14:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-21 05:14:06,276 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-21 05:14:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-21 05:14:06,276 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-21 05:14:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-21 05:14:06,276 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-21 05:14:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-21 05:14:06,277 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-21 05:14:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-21 05:14:06,277 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-21 05:14:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-21 05:14:06,277 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-21 05:14:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:14:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-21 05:14:06,278 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-21 05:14:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:14:06,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:14:06,372 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:14:06,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:14:06,734 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:14:06,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:14:06,755 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 05:14:06,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:14:06 BoogieIcfgContainer [2022-07-21 05:14:06,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:14:06,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:14:06,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:14:06,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:14:06,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:14:05" (1/3) ... [2022-07-21 05:14:06,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63316c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:14:06, skipping insertion in model container [2022-07-21 05:14:06,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:14:06" (2/3) ... [2022-07-21 05:14:06,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63316c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:14:06, skipping insertion in model container [2022-07-21 05:14:06,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:14:06" (3/3) ... [2022-07-21 05:14:06,768 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-07-21 05:14:06,782 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:14:06,782 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:14:06,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:14:06,842 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@14e6c19e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f652965 [2022-07-21 05:14:06,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:14:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 89 states have (on average 1.550561797752809) internal successors, (138), 93 states have internal predecessors, (138), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-21 05:14:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 05:14:06,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:06,871 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] [2022-07-21 05:14:06,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1377578721, now seen corresponding path program 1 times [2022-07-21 05:14:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:06,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417087416] [2022-07-21 05:14:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:07,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:07,248 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-21 05:14:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417087416] [2022-07-21 05:14:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417087416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:07,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:14:07,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:14:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600489827] [2022-07-21 05:14:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:07,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:14:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:14:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:14:07,293 INFO L87 Difference]: Start difference. First operand has 115 states, 89 states have (on average 1.550561797752809) internal successors, (138), 93 states have internal predecessors, (138), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:08,019 INFO L93 Difference]: Finished difference Result 361 states and 553 transitions. [2022-07-21 05:14:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:14:08,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-21 05:14:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:08,033 INFO L225 Difference]: With dead ends: 361 [2022-07-21 05:14:08,033 INFO L226 Difference]: Without dead ends: 247 [2022-07-21 05:14:08,037 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-21 05:14:08,040 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 309 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:08,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 498 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 05:14:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-21 05:14:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2022-07-21 05:14:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 163 states have (on average 1.4662576687116564) internal successors, (239), 166 states have internal predecessors, (239), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-21 05:14:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2022-07-21 05:14:08,115 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 57 [2022-07-21 05:14:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:08,115 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2022-07-21 05:14:08,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2022-07-21 05:14:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 05:14:08,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:08,118 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] [2022-07-21 05:14:08,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:14:08,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1123129379, now seen corresponding path program 1 times [2022-07-21 05:14:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:08,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419041173] [2022-07-21 05:14:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:08,247 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-21 05:14:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:08,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419041173] [2022-07-21 05:14:08,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419041173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:08,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:14:08,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:14:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514065018] [2022-07-21 05:14:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:14:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:14:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:14:08,258 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:08,954 INFO L93 Difference]: Finished difference Result 555 states and 802 transitions. [2022-07-21 05:14:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 05:14:08,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-21 05:14:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:08,958 INFO L225 Difference]: With dead ends: 555 [2022-07-21 05:14:08,958 INFO L226 Difference]: Without dead ends: 360 [2022-07-21 05:14:08,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-21 05:14:08,961 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 288 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:08,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 792 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 05:14:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-21 05:14:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2022-07-21 05:14:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 236 states have (on average 1.4576271186440677) internal successors, (344), 240 states have internal predecessors, (344), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-21 05:14:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2022-07-21 05:14:08,990 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 57 [2022-07-21 05:14:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:08,990 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2022-07-21 05:14:08,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2022-07-21 05:14:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 05:14:08,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:08,993 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] [2022-07-21 05:14:08,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:14:08,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash -229643041, now seen corresponding path program 1 times [2022-07-21 05:14:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:08,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194364071] [2022-07-21 05:14:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,115 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-21 05:14:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194364071] [2022-07-21 05:14:09,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194364071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:09,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:14:09,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:14:09,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800171747] [2022-07-21 05:14:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:09,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:14:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:14:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:14:09,118 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:09,726 INFO L93 Difference]: Finished difference Result 906 states and 1299 transitions. [2022-07-21 05:14:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 05:14:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-21 05:14:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:09,731 INFO L225 Difference]: With dead ends: 906 [2022-07-21 05:14:09,731 INFO L226 Difference]: Without dead ends: 621 [2022-07-21 05:14:09,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:14:09,734 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 342 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:09,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 774 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:14:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-07-21 05:14:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 469. [2022-07-21 05:14:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 379 states have (on average 1.4538258575197889) internal successors, (551), 385 states have internal predecessors, (551), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-21 05:14:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 672 transitions. [2022-07-21 05:14:09,775 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 672 transitions. Word has length 57 [2022-07-21 05:14:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:09,776 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 672 transitions. [2022-07-21 05:14:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 672 transitions. [2022-07-21 05:14:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 05:14:09,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:09,778 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] [2022-07-21 05:14:09,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 05:14:09,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2015936413, now seen corresponding path program 1 times [2022-07-21 05:14:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:09,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702101062] [2022-07-21 05:14:09,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:09,855 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-21 05:14:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:09,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702101062] [2022-07-21 05:14:09,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702101062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:09,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:14:09,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:14:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209233814] [2022-07-21 05:14:09,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:14:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:09,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:14:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:14:09,858 INFO L87 Difference]: Start difference. First operand 469 states and 672 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:10,537 INFO L93 Difference]: Finished difference Result 1458 states and 2090 transitions. [2022-07-21 05:14:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 05:14:10,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-21 05:14:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:10,544 INFO L225 Difference]: With dead ends: 1458 [2022-07-21 05:14:10,545 INFO L226 Difference]: Without dead ends: 998 [2022-07-21 05:14:10,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:14:10,548 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 285 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:10,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 757 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 05:14:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-07-21 05:14:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 768. [2022-07-21 05:14:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 620 states have (on average 1.4306451612903226) internal successors, (887), 630 states have internal predecessors, (887), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-07-21 05:14:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1094 transitions. [2022-07-21 05:14:10,595 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1094 transitions. Word has length 57 [2022-07-21 05:14:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:10,595 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1094 transitions. [2022-07-21 05:14:10,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1094 transitions. [2022-07-21 05:14:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 05:14:10,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:10,598 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] [2022-07-21 05:14:10,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 05:14:10,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1118543135, now seen corresponding path program 1 times [2022-07-21 05:14:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:10,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907217171] [2022-07-21 05:14:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:10,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:10,670 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-21 05:14:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:10,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907217171] [2022-07-21 05:14:10,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907217171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:10,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:14:10,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:14:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048658614] [2022-07-21 05:14:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:10,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:14:10,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:10,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:14:10,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:14:10,673 INFO L87 Difference]: Start difference. First operand 768 states and 1094 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:11,172 INFO L93 Difference]: Finished difference Result 2132 states and 3040 transitions. [2022-07-21 05:14:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:14:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-21 05:14:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:11,180 INFO L225 Difference]: With dead ends: 2132 [2022-07-21 05:14:11,180 INFO L226 Difference]: Without dead ends: 1374 [2022-07-21 05:14:11,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:14:11,184 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 397 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:11,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 576 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:14:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-21 05:14:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1169. [2022-07-21 05:14:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 938 states have (on average 1.3997867803837953) internal successors, (1313), 957 states have internal predecessors, (1313), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-07-21 05:14:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1628 transitions. [2022-07-21 05:14:11,249 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1628 transitions. Word has length 57 [2022-07-21 05:14:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:11,249 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1628 transitions. [2022-07-21 05:14:11,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:14:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1628 transitions. [2022-07-21 05:14:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-21 05:14:11,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:11,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 05:14:11,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 05:14:11,254 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash -712241775, now seen corresponding path program 1 times [2022-07-21 05:14:11,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:11,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323206504] [2022-07-21 05:14:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:14:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 05:14:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:14:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:11,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323206504] [2022-07-21 05:14:11,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323206504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:11,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755135217] [2022-07-21 05:14:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:11,383 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-21 05:14:11,413 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-21 05:14:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:11,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:14:11,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 05:14:11,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:11,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755135217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:11,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:11,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 05:14:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364494163] [2022-07-21 05:14:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:11,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:14:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:14:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:11,504 INFO L87 Difference]: Start difference. First operand 1169 states and 1628 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:11,644 INFO L93 Difference]: Finished difference Result 3375 states and 4754 transitions. [2022-07-21 05:14:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:14:11,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-07-21 05:14:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:11,656 INFO L225 Difference]: With dead ends: 3375 [2022-07-21 05:14:11,656 INFO L226 Difference]: Without dead ends: 2217 [2022-07-21 05:14:11,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:11,691 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 114 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:11,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 421 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:14:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2022-07-21 05:14:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2022-07-21 05:14:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1777 states have (on average 1.37816544738323) internal successors, (2449), 1809 states have internal predecessors, (2449), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2022-07-21 05:14:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3080 transitions. [2022-07-21 05:14:11,812 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3080 transitions. Word has length 92 [2022-07-21 05:14:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:11,813 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 3080 transitions. [2022-07-21 05:14:11,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3080 transitions. [2022-07-21 05:14:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 05:14:11,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:11,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:11,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 05:14:12,039 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,SelfDestructingSolverStorable5 [2022-07-21 05:14:12,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2098539431, now seen corresponding path program 1 times [2022-07-21 05:14:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:12,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778777951] [2022-07-21 05:14:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:14:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 05:14:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 05:14:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 05:14:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778777951] [2022-07-21 05:14:12,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778777951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:12,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964174848] [2022-07-21 05:14:12,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:12,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:12,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:12,204 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-21 05:14:12,205 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-21 05:14:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:12,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:14:12,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 05:14:12,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:12,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964174848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:12,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:12,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-21 05:14:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316162262] [2022-07-21 05:14:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:12,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:14:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:12,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:14:12,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:12,421 INFO L87 Difference]: Start difference. First operand 2217 states and 3080 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 05:14:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:12,596 INFO L93 Difference]: Finished difference Result 6487 states and 9053 transitions. [2022-07-21 05:14:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:14:12,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-07-21 05:14:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:12,620 INFO L225 Difference]: With dead ends: 6487 [2022-07-21 05:14:12,620 INFO L226 Difference]: Without dead ends: 4284 [2022-07-21 05:14:12,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:12,630 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 81 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 315 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-21 05:14:12,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 315 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:14:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2022-07-21 05:14:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4224. [2022-07-21 05:14:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4224 states, 3390 states have (on average 1.370796460176991) internal successors, (4647), 3451 states have internal predecessors, (4647), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2022-07-21 05:14:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 5810 transitions. [2022-07-21 05:14:12,882 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 5810 transitions. Word has length 118 [2022-07-21 05:14:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:12,882 INFO L495 AbstractCegarLoop]: Abstraction has 4224 states and 5810 transitions. [2022-07-21 05:14:12,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 05:14:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 5810 transitions. [2022-07-21 05:14:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 05:14:12,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:12,895 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:12,925 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-21 05:14:13,111 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,SelfDestructingSolverStorable6 [2022-07-21 05:14:13,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1491695225, now seen corresponding path program 1 times [2022-07-21 05:14:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823553366] [2022-07-21 05:14:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 05:14:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 05:14:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 05:14:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 05:14:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-21 05:14:13,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:13,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823553366] [2022-07-21 05:14:13,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823553366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:13,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260270976] [2022-07-21 05:14:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:13,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:13,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:13,248 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-21 05:14:13,278 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-21 05:14:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:13,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 05:14:13,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 05:14:13,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:13,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260270976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:13,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:13,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 05:14:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931259495] [2022-07-21 05:14:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:13,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:14:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:13,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:14:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:13,406 INFO L87 Difference]: Start difference. First operand 4224 states and 5810 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 05:14:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:13,602 INFO L93 Difference]: Finished difference Result 7498 states and 10341 transitions. [2022-07-21 05:14:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:14:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 134 [2022-07-21 05:14:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:13,628 INFO L225 Difference]: With dead ends: 7498 [2022-07-21 05:14:13,628 INFO L226 Difference]: Without dead ends: 4552 [2022-07-21 05:14:13,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:13,643 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:13,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 314 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:14:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2022-07-21 05:14:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4514. [2022-07-21 05:14:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4514 states, 3648 states have (on average 1.3434758771929824) internal successors, (4901), 3709 states have internal predecessors, (4901), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-07-21 05:14:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6102 transitions. [2022-07-21 05:14:13,869 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6102 transitions. Word has length 134 [2022-07-21 05:14:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:13,869 INFO L495 AbstractCegarLoop]: Abstraction has 4514 states and 6102 transitions. [2022-07-21 05:14:13,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 05:14:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6102 transitions. [2022-07-21 05:14:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 05:14:13,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:13,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:13,909 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-21 05:14:14,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:14,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1657376431, now seen corresponding path program 1 times [2022-07-21 05:14:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993623134] [2022-07-21 05:14:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 05:14:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 05:14:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:14,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993623134] [2022-07-21 05:14:14,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993623134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744125157] [2022-07-21 05:14:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:14,216 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-21 05:14:14,245 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-21 05:14:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:14,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 05:14:14,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 05:14:14,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744125157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:14,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:14,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 05:14:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271569597] [2022-07-21 05:14:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:14,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:14:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:14:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:14,349 INFO L87 Difference]: Start difference. First operand 4514 states and 6102 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 05:14:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:14,524 INFO L93 Difference]: Finished difference Result 6910 states and 9481 transitions. [2022-07-21 05:14:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:14:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-07-21 05:14:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:14,547 INFO L225 Difference]: With dead ends: 6910 [2022-07-21 05:14:14,548 INFO L226 Difference]: Without dead ends: 4550 [2022-07-21 05:14:14,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:14,559 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 111 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 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-21 05:14:14,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:14:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2022-07-21 05:14:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4490. [2022-07-21 05:14:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 3624 states have (on average 1.319812362030905) internal successors, (4783), 3685 states have internal predecessors, (4783), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-07-21 05:14:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 5984 transitions. [2022-07-21 05:14:14,796 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 5984 transitions. Word has length 135 [2022-07-21 05:14:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:14,797 INFO L495 AbstractCegarLoop]: Abstraction has 4490 states and 5984 transitions. [2022-07-21 05:14:14,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 05:14:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 5984 transitions. [2022-07-21 05:14:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 05:14:14,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:14,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:14,837 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-21 05:14:15,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:15,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1768717425, now seen corresponding path program 1 times [2022-07-21 05:14:15,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:15,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276695535] [2022-07-21 05:14:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:15,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 05:14:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 05:14:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:15,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276695535] [2022-07-21 05:14:15,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276695535] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:15,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192678235] [2022-07-21 05:14:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:15,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:15,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:15,115 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-21 05:14:15,116 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-21 05:14:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:14:15,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 05:14:15,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:15,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192678235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:15,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:15,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 05:14:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870206137] [2022-07-21 05:14:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:15,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:14:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:15,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:14:15,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:15,236 INFO L87 Difference]: Start difference. First operand 4490 states and 5984 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 05:14:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:15,414 INFO L93 Difference]: Finished difference Result 7814 states and 10540 transitions. [2022-07-21 05:14:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:14:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-07-21 05:14:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:15,432 INFO L225 Difference]: With dead ends: 7814 [2022-07-21 05:14:15,432 INFO L226 Difference]: Without dead ends: 3872 [2022-07-21 05:14:15,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:14:15,443 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:15,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:14:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2022-07-21 05:14:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3642. [2022-07-21 05:14:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3642 states, 2942 states have (on average 1.270904146838885) internal successors, (3739), 2987 states have internal predecessors, (3739), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2022-07-21 05:14:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4642 transitions. [2022-07-21 05:14:15,628 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4642 transitions. Word has length 135 [2022-07-21 05:14:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:15,628 INFO L495 AbstractCegarLoop]: Abstraction has 3642 states and 4642 transitions. [2022-07-21 05:14:15,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 05:14:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4642 transitions. [2022-07-21 05:14:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 05:14:15,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:15,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:15,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 05:14:15,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 05:14:15,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -829055518, now seen corresponding path program 1 times [2022-07-21 05:14:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:15,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606794169] [2022-07-21 05:14:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 05:14:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 05:14:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:15,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606794169] [2022-07-21 05:14:15,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606794169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:15,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356087237] [2022-07-21 05:14:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:15,971 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-21 05:14:15,973 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-21 05:14:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:14:16,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-21 05:14:16,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356087237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:16,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:16,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 05:14:16,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606421533] [2022-07-21 05:14:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:16,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:14:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:14:16,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:14:16,162 INFO L87 Difference]: Start difference. First operand 3642 states and 4642 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:16,417 INFO L93 Difference]: Finished difference Result 5070 states and 6521 transitions. [2022-07-21 05:14:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:14:16,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-21 05:14:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:16,451 INFO L225 Difference]: With dead ends: 5070 [2022-07-21 05:14:16,451 INFO L226 Difference]: Without dead ends: 2712 [2022-07-21 05:14:16,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:14:16,460 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 150 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:16,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 287 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:14:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2022-07-21 05:14:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2700. [2022-07-21 05:14:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2182 states have (on average 1.2396883593033914) internal successors, (2705), 2209 states have internal predecessors, (2705), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-07-21 05:14:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3356 transitions. [2022-07-21 05:14:16,682 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3356 transitions. Word has length 136 [2022-07-21 05:14:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:16,683 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 3356 transitions. [2022-07-21 05:14:16,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3356 transitions. [2022-07-21 05:14:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 05:14:16,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:16,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:16,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 05:14:16,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:16,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1599203104, now seen corresponding path program 1 times [2022-07-21 05:14:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:16,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500132279] [2022-07-21 05:14:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 05:14:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 05:14:17,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:17,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500132279] [2022-07-21 05:14:17,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500132279] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282805525] [2022-07-21 05:14:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:17,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:17,021 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-21 05:14:17,022 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-21 05:14:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:14:17,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-21 05:14:17,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:17,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282805525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:17,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:17,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 05:14:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664247258] [2022-07-21 05:14:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:17,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:14:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:14:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:14:17,195 INFO L87 Difference]: Start difference. First operand 2700 states and 3356 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:17,478 INFO L93 Difference]: Finished difference Result 5041 states and 6343 transitions. [2022-07-21 05:14:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:14:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-21 05:14:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:17,489 INFO L225 Difference]: With dead ends: 5041 [2022-07-21 05:14:17,490 INFO L226 Difference]: Without dead ends: 2648 [2022-07-21 05:14:17,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:14:17,498 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 171 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:17,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 294 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:14:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2022-07-21 05:14:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1674. [2022-07-21 05:14:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1368 states have (on average 1.192251461988304) internal successors, (1631), 1383 states have internal predecessors, (1631), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-07-21 05:14:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2009 transitions. [2022-07-21 05:14:17,599 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2009 transitions. Word has length 136 [2022-07-21 05:14:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:17,599 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2009 transitions. [2022-07-21 05:14:17,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2009 transitions. [2022-07-21 05:14:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 05:14:17,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:17,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:17,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 05:14:17,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:17,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 292060706, now seen corresponding path program 1 times [2022-07-21 05:14:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613501646] [2022-07-21 05:14:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 05:14:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 05:14:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:17,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613501646] [2022-07-21 05:14:17,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613501646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:17,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799858557] [2022-07-21 05:14:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:17,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:17,935 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:14:17,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 05:14:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 05:14:18,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-21 05:14:18,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:18,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799858557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:18,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:18,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 05:14:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667353942] [2022-07-21 05:14:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:18,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:14:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:18,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:14:18,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:14:18,067 INFO L87 Difference]: Start difference. First operand 1674 states and 2009 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:18,183 INFO L93 Difference]: Finished difference Result 2813 states and 3395 transitions. [2022-07-21 05:14:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:14:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-21 05:14:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:18,188 INFO L225 Difference]: With dead ends: 2813 [2022-07-21 05:14:18,189 INFO L226 Difference]: Without dead ends: 1149 [2022-07-21 05:14:18,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:14:18,194 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:18,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:14:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-21 05:14:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1113. [2022-07-21 05:14:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 914 states have (on average 1.163019693654267) internal successors, (1063), 925 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-21 05:14:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1296 transitions. [2022-07-21 05:14:18,264 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1296 transitions. Word has length 136 [2022-07-21 05:14:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:18,264 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1296 transitions. [2022-07-21 05:14:18,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1296 transitions. [2022-07-21 05:14:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 05:14:18,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:18,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:18,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 05:14:18,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 05:14:18,480 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1014844378, now seen corresponding path program 1 times [2022-07-21 05:14:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:18,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278964501] [2022-07-21 05:14:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 05:14:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-21 05:14:18,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:18,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278964501] [2022-07-21 05:14:18,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278964501] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:14:18,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597822718] [2022-07-21 05:14:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:14:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:14:18,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:14:18,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 05:14:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:18,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 05:14:18,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:14:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 05:14:18,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:14:18,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597822718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:18,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:14:18,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 05:14:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713059788] [2022-07-21 05:14:18,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:18,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:14:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:14:18,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:14:18,677 INFO L87 Difference]: Start difference. First operand 1113 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:18,766 INFO L93 Difference]: Finished difference Result 2244 states and 2657 transitions. [2022-07-21 05:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:14:18,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-07-21 05:14:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:18,770 INFO L225 Difference]: With dead ends: 2244 [2022-07-21 05:14:18,770 INFO L226 Difference]: Without dead ends: 1141 [2022-07-21 05:14:18,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:14:18,774 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 10 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:18,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 571 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:14:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-07-21 05:14:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1125. [2022-07-21 05:14:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 926 states have (on average 1.1382289416846652) internal successors, (1054), 937 states have internal predecessors, (1054), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-21 05:14:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1287 transitions. [2022-07-21 05:14:18,842 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1287 transitions. Word has length 136 [2022-07-21 05:14:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:18,843 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1287 transitions. [2022-07-21 05:14:18,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1287 transitions. [2022-07-21 05:14:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 05:14:18,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:18,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:18,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 05:14:19,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 05:14:19,072 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1278811050, now seen corresponding path program 1 times [2022-07-21 05:14:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343328898] [2022-07-21 05:14:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 05:14:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-21 05:14:19,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:19,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343328898] [2022-07-21 05:14:19,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343328898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:19,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:14:19,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:14:19,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307716453] [2022-07-21 05:14:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:14:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:14:19,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:14:19,195 INFO L87 Difference]: Start difference. First operand 1125 states and 1287 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 05:14:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:19,739 INFO L93 Difference]: Finished difference Result 2085 states and 2361 transitions. [2022-07-21 05:14:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 05:14:19,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-07-21 05:14:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:19,747 INFO L225 Difference]: With dead ends: 2085 [2022-07-21 05:14:19,748 INFO L226 Difference]: Without dead ends: 2082 [2022-07-21 05:14:19,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:14:19,750 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 486 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:19,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 514 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:14:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-07-21 05:14:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1501. [2022-07-21 05:14:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1236 states have (on average 1.1375404530744337) internal successors, (1406), 1251 states have internal predecessors, (1406), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-21 05:14:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1715 transitions. [2022-07-21 05:14:19,872 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1715 transitions. Word has length 136 [2022-07-21 05:14:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:19,873 INFO L495 AbstractCegarLoop]: Abstraction has 1501 states and 1715 transitions. [2022-07-21 05:14:19,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 05:14:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1715 transitions. [2022-07-21 05:14:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-21 05:14:19,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:19,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:19,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 05:14:19,876 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1930463342, now seen corresponding path program 1 times [2022-07-21 05:14:19,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:19,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055802542] [2022-07-21 05:14:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:19,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:14:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:14:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 05:14:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 05:14:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:14:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:14:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:14:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:14:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 05:14:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 05:14:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:14:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 05:14:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:14:19,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055802542] [2022-07-21 05:14:19,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055802542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:14:19,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:14:19,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:14:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773409969] [2022-07-21 05:14:19,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:14:19,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:14:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:14:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:14:19,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:14:19,949 INFO L87 Difference]: Start difference. First operand 1501 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:14:20,276 INFO L93 Difference]: Finished difference Result 2724 states and 3203 transitions. [2022-07-21 05:14:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:14:20,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 140 [2022-07-21 05:14:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:14:20,283 INFO L225 Difference]: With dead ends: 2724 [2022-07-21 05:14:20,283 INFO L226 Difference]: Without dead ends: 1864 [2022-07-21 05:14:20,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:14:20,287 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 142 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:14:20,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 467 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:14:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-07-21 05:14:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1503. [2022-07-21 05:14:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1238 states have (on average 1.137318255250404) internal successors, (1408), 1253 states have internal predecessors, (1408), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-21 05:14:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1717 transitions. [2022-07-21 05:14:20,399 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1717 transitions. Word has length 140 [2022-07-21 05:14:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:14:20,400 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1717 transitions. [2022-07-21 05:14:20,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 05:14:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1717 transitions. [2022-07-21 05:14:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 05:14:20,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:14:20,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:20,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 05:14:20,403 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:14:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:14:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1514412424, now seen corresponding path program 1 times [2022-07-21 05:14:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:14:20,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980731887] [2022-07-21 05:14:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:14:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:14:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:14:20,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:14:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:14:20,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:14:20,457 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:14:20,458 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:14:20,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 05:14:20,462 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:14:20,466 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:14:20,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:14:20 BoogieIcfgContainer [2022-07-21 05:14:20,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:14:20,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:14:20,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:14:20,564 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:14:20,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:14:06" (3/4) ... [2022-07-21 05:14:20,566 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:14:20,665 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:14:20,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:14:20,666 INFO L158 Benchmark]: Toolchain (without parser) took 14896.93ms. Allocated memory was 54.5MB in the beginning and 440.4MB in the end (delta: 385.9MB). Free memory was 31.9MB in the beginning and 209.9MB in the end (delta: -178.0MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. [2022-07-21 05:14:20,666 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:14:20,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.06ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.7MB in the beginning and 49.2MB in the end (delta: -17.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-07-21 05:14:20,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.94ms. Allocated memory is still 67.1MB. Free memory was 49.2MB in the beginning and 47.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 05:14:20,668 INFO L158 Benchmark]: Boogie Preprocessor took 52.30ms. Allocated memory is still 67.1MB. Free memory was 47.2MB in the beginning and 45.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:14:20,668 INFO L158 Benchmark]: RCFGBuilder took 559.73ms. Allocated memory is still 67.1MB. Free memory was 45.6MB in the beginning and 45.1MB in the end (delta: 529.2kB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-07-21 05:14:20,669 INFO L158 Benchmark]: TraceAbstraction took 13803.57ms. Allocated memory was 67.1MB in the beginning and 440.4MB in the end (delta: 373.3MB). Free memory was 44.4MB in the beginning and 220.4MB in the end (delta: -175.9MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB. [2022-07-21 05:14:20,669 INFO L158 Benchmark]: Witness Printer took 101.56ms. Allocated memory is still 440.4MB. Free memory was 220.4MB in the beginning and 209.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 05:14:20,673 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.32ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.06ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.7MB in the beginning and 49.2MB in the end (delta: -17.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.94ms. Allocated memory is still 67.1MB. Free memory was 49.2MB in the beginning and 47.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.30ms. Allocated memory is still 67.1MB. Free memory was 47.2MB in the beginning and 45.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 559.73ms. Allocated memory is still 67.1MB. Free memory was 45.6MB in the beginning and 45.1MB in the end (delta: 529.2kB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13803.57ms. Allocated memory was 67.1MB in the beginning and 440.4MB in the end (delta: 373.3MB). Free memory was 44.4MB in the beginning and 220.4MB in the end (delta: -175.9MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB. * Witness Printer took 101.56ms. Allocated memory is still 440.4MB. Free memory was 220.4MB in the beginning and 209.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L353] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L167] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L353] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L119] token += 1 [L120] E_M = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L353] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L136] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L137] COND TRUE E_M == 1 [L138] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND TRUE \read(tmp) [L332] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L156] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L165] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L167] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L353] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] RET immediate_notify() VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L122] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L47] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L69] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L82] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L83] CALL error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L20] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3274 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3166 mSDsluCounter, 7743 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4580 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3724 IncrementalHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 3163 mSDtfsCounter, 3724 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1451 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4514occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3018 NumberOfCodeBlocks, 3018 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2852 ConstructedInterpolants, 0 QuantifiedInterpolants, 4610 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3590 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 05:14:20,710 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