./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 6c24879c 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-?-6c24879 [2022-07-12 06:32:53,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:32:53,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:32:53,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:32:53,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:32:53,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:32:53,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:32:53,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:32:53,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:32:53,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:32:53,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:32:53,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:32:53,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:32:53,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:32:53,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:32:53,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:32:53,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:32:53,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:32:53,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:32:53,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:32:53,353 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:32:53,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:32:53,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:32:53,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:32:53,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:32:53,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:32:53,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:32:53,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:32:53,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:32:53,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:32:53,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:32:53,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:32:53,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:32:53,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:32:53,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:32:53,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:32:53,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:32:53,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:32:53,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:32:53,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:32:53,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:32:53,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:32:53,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:32:53,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:32:53,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:32:53,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:32:53,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:32:53,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:32:53,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:32:53,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:32:53,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:32:53,400 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:32:53,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:32:53,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:32:53,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:32:53,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:32:53,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:32:53,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:32:53,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:32:53,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:32:53,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:32:53,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:32:53,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:32:53,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:32:53,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:32:53,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:32:53,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:32:53,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:32:53,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:32:53,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:32:53,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:32:53,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:32:53,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:32:53,404 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:32:53,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:32:53,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:32:53,404 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-12 06:32:53,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:32:53,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:32:53,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:32:53,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:32:53,596 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:32:53,597 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-12 06:32:53,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62002c63b/6456e662ff69487eb85b2b239ae64438/FLAG9b26e464a [2022-07-12 06:32:54,024 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:32:54,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-07-12 06:32:54,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62002c63b/6456e662ff69487eb85b2b239ae64438/FLAG9b26e464a [2022-07-12 06:32:54,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62002c63b/6456e662ff69487eb85b2b239ae64438 [2022-07-12 06:32:54,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:32:54,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:32:54,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:32:54,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:32:54,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:32:54,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0c6977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54, skipping insertion in model container [2022-07-12 06:32:54,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:32:54,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:32:54,220 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-12 06:32:54,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:32:54,257 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:32:54,266 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-12 06:32:54,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:32:54,293 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:32:54,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54 WrapperNode [2022-07-12 06:32:54,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:32:54,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:32:54,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:32:54,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:32:54,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,324 INFO L137 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 220 [2022-07-12 06:32:54,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:32:54,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:32:54,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:32:54,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:32:54,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:32:54,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:32:54,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:32:54,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:32:54,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (1/1) ... [2022-07-12 06:32:54,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:32:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:32:54,373 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-12 06:32:54,379 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-12 06:32:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:32:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-12 06:32:54,403 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-12 06:32:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-12 06:32:54,403 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-12 06:32:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-12 06:32:54,404 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-12 06:32:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-12 06:32:54,404 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-12 06:32:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-12 06:32:54,404 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-12 06:32:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-12 06:32:54,405 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-12 06:32:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:32:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-12 06:32:54,405 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-12 06:32:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:32:54,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:32:54,475 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:32:54,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:32:54,779 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:32:54,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:32:54,784 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 06:32:54,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:54 BoogieIcfgContainer [2022-07-12 06:32:54,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:32:54,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:32:54,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:32:54,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:32:54,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:32:54" (1/3) ... [2022-07-12 06:32:54,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b1cbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:32:54, skipping insertion in model container [2022-07-12 06:32:54,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:54" (2/3) ... [2022-07-12 06:32:54,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b1cbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:32:54, skipping insertion in model container [2022-07-12 06:32:54,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:54" (3/3) ... [2022-07-12 06:32:54,794 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-07-12 06:32:54,804 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:32:54,804 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:32:54,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:32:54,863 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@1f478b11, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60e01f36 [2022-07-12 06:32:54,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:32:54,866 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-12 06:32:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 06:32:54,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:54,884 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-12 06:32:54,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:54,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:54,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1377578721, now seen corresponding path program 1 times [2022-07-12 06:32:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:54,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356342919] [2022-07-12 06:32:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,138 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-12 06:32:55,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:55,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356342919] [2022-07-12 06:32:55,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356342919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:55,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:32:55,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:32:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892608002] [2022-07-12 06:32:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:55,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:32:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:32:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:32:55,171 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-12 06:32:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:55,684 INFO L93 Difference]: Finished difference Result 361 states and 553 transitions. [2022-07-12 06:32:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:32:55,686 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-12 06:32:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:55,709 INFO L225 Difference]: With dead ends: 361 [2022-07-12 06:32:55,710 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 06:32:55,713 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-12 06:32:55,715 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 309 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 06:32:55,716 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.4s Time] [2022-07-12 06:32:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 06:32:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2022-07-12 06:32:55,753 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-12 06:32:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2022-07-12 06:32:55,756 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 57 [2022-07-12 06:32:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:55,756 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2022-07-12 06:32:55,757 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-12 06:32:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2022-07-12 06:32:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 06:32:55,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:55,759 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-12 06:32:55,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:32:55,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1123129379, now seen corresponding path program 1 times [2022-07-12 06:32:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:55,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397260659] [2022-07-12 06:32:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:55,831 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-12 06:32:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:55,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397260659] [2022-07-12 06:32:55,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397260659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:55,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:32:55,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:32:55,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148634471] [2022-07-12 06:32:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:55,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:32:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:55,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:32:55,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:32:55,834 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-12 06:32:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:56,298 INFO L93 Difference]: Finished difference Result 555 states and 802 transitions. [2022-07-12 06:32:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 06:32:56,299 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-12 06:32:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:56,301 INFO L225 Difference]: With dead ends: 555 [2022-07-12 06:32:56,302 INFO L226 Difference]: Without dead ends: 360 [2022-07-12 06:32:56,303 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-12 06:32:56,304 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 288 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 06:32:56,304 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.4s Time] [2022-07-12 06:32:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-12 06:32:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2022-07-12 06:32:56,323 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-12 06:32:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2022-07-12 06:32:56,325 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 57 [2022-07-12 06:32:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:56,326 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2022-07-12 06:32:56,326 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-12 06:32:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2022-07-12 06:32:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 06:32:56,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:56,330 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-12 06:32:56,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:32:56,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash -229643041, now seen corresponding path program 1 times [2022-07-12 06:32:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:56,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373962107] [2022-07-12 06:32:56,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,421 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-12 06:32:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:56,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373962107] [2022-07-12 06:32:56,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373962107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:56,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:32:56,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:32:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954176330] [2022-07-12 06:32:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:56,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:32:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:32:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:32:56,423 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-12 06:32:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:56,887 INFO L93 Difference]: Finished difference Result 906 states and 1299 transitions. [2022-07-12 06:32:56,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:32:56,888 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-12 06:32:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:56,891 INFO L225 Difference]: With dead ends: 906 [2022-07-12 06:32:56,891 INFO L226 Difference]: Without dead ends: 621 [2022-07-12 06:32:56,893 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-12 06:32:56,894 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 342 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 06:32:56,894 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-12 06:32:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-07-12 06:32:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 469. [2022-07-12 06:32:56,926 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-12 06:32:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 672 transitions. [2022-07-12 06:32:56,928 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 672 transitions. Word has length 57 [2022-07-12 06:32:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:56,929 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 672 transitions. [2022-07-12 06:32:56,929 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-12 06:32:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 672 transitions. [2022-07-12 06:32:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 06:32:56,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:56,935 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-12 06:32:56,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 06:32:56,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2015936413, now seen corresponding path program 1 times [2022-07-12 06:32:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:56,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758711051] [2022-07-12 06:32:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,035 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-12 06:32:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758711051] [2022-07-12 06:32:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758711051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:57,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:32:57,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:32:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151036255] [2022-07-12 06:32:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:57,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:32:57,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:32:57,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:32:57,038 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-12 06:32:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:57,544 INFO L93 Difference]: Finished difference Result 1458 states and 2090 transitions. [2022-07-12 06:32:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:32:57,545 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-12 06:32:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:57,549 INFO L225 Difference]: With dead ends: 1458 [2022-07-12 06:32:57,550 INFO L226 Difference]: Without dead ends: 998 [2022-07-12 06:32:57,551 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-12 06:32:57,552 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 285 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 06:32:57,552 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.4s Time] [2022-07-12 06:32:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-07-12 06:32:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 768. [2022-07-12 06:32:57,581 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-12 06:32:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1094 transitions. [2022-07-12 06:32:57,584 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1094 transitions. Word has length 57 [2022-07-12 06:32:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:57,584 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1094 transitions. [2022-07-12 06:32:57,585 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-12 06:32:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1094 transitions. [2022-07-12 06:32:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 06:32:57,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:57,600 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-12 06:32:57,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 06:32:57,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1118543135, now seen corresponding path program 1 times [2022-07-12 06:32:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:57,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822363027] [2022-07-12 06:32:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:57,664 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-12 06:32:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:57,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822363027] [2022-07-12 06:32:57,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822363027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:57,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:32:57,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:32:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103175523] [2022-07-12 06:32:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:57,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:32:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:32:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:32:57,669 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-12 06:32:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:58,024 INFO L93 Difference]: Finished difference Result 2132 states and 3040 transitions. [2022-07-12 06:32:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:32:58,024 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-12 06:32:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:58,030 INFO L225 Difference]: With dead ends: 2132 [2022-07-12 06:32:58,030 INFO L226 Difference]: Without dead ends: 1374 [2022-07-12 06:32:58,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:32:58,033 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 397 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:32:58,034 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.3s Time] [2022-07-12 06:32:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-12 06:32:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1169. [2022-07-12 06:32:58,077 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-12 06:32:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1628 transitions. [2022-07-12 06:32:58,082 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1628 transitions. Word has length 57 [2022-07-12 06:32:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:58,082 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1628 transitions. [2022-07-12 06:32:58,082 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-12 06:32:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1628 transitions. [2022-07-12 06:32:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 06:32:58,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:58,085 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-12 06:32:58,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 06:32:58,086 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -712241775, now seen corresponding path program 1 times [2022-07-12 06:32:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:58,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964247050] [2022-07-12 06:32:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:32:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:32:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 06:32:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,176 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-12 06:32:58,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964247050] [2022-07-12 06:32:58,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964247050] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:32:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297007849] [2022-07-12 06:32:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:32:58,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:32:58,179 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-12 06:32:58,181 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-12 06:32:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 06:32:58,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:32:58,281 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-12 06:32:58,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:32:58,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297007849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:58,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:32:58,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 06:32:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527385361] [2022-07-12 06:32:58,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:58,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:32:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:32:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:32:58,283 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-12 06:32:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:58,364 INFO L93 Difference]: Finished difference Result 3375 states and 4754 transitions. [2022-07-12 06:32:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:32:58,365 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-12 06:32:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:58,374 INFO L225 Difference]: With dead ends: 3375 [2022-07-12 06:32:58,374 INFO L226 Difference]: Without dead ends: 2217 [2022-07-12 06:32:58,378 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-12 06:32:58,378 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-12 06:32:58,379 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-12 06:32:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2022-07-12 06:32:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2022-07-12 06:32:58,464 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-12 06:32:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3080 transitions. [2022-07-12 06:32:58,472 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3080 transitions. Word has length 92 [2022-07-12 06:32:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:58,472 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 3080 transitions. [2022-07-12 06:32:58,473 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-12 06:32:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3080 transitions. [2022-07-12 06:32:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 06:32:58,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:58,478 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-12 06:32:58,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 06:32:58,695 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-12 06:32:58,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2098539431, now seen corresponding path program 1 times [2022-07-12 06:32:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:58,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786113969] [2022-07-12 06:32:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:32:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:32:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 06:32:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:32:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 06:32:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,782 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-12 06:32:58,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:58,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786113969] [2022-07-12 06:32:58,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786113969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:32:58,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350978632] [2022-07-12 06:32:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:58,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:32:58,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:32:58,800 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-12 06:32:58,800 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-12 06:32:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:58,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 06:32:58,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:32:58,962 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-12 06:32:58,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:32:58,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350978632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:58,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:32:58,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-12 06:32:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173575658] [2022-07-12 06:32:58,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:58,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:32:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:32:58,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:32:58,964 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-12 06:32:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:59,101 INFO L93 Difference]: Finished difference Result 6487 states and 9053 transitions. [2022-07-12 06:32:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:32:59,102 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-12 06:32:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:59,119 INFO L225 Difference]: With dead ends: 6487 [2022-07-12 06:32:59,119 INFO L226 Difference]: Without dead ends: 4284 [2022-07-12 06:32:59,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 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-12 06:32:59,125 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-12 06:32:59,126 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-12 06:32:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2022-07-12 06:32:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4224. [2022-07-12 06:32:59,272 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-12 06:32:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 5810 transitions. [2022-07-12 06:32:59,286 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 5810 transitions. Word has length 118 [2022-07-12 06:32:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:32:59,287 INFO L495 AbstractCegarLoop]: Abstraction has 4224 states and 5810 transitions. [2022-07-12 06:32:59,287 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-12 06:32:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 5810 transitions. [2022-07-12 06:32:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 06:32:59,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:32:59,295 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-12 06:32:59,313 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-12 06:32:59,511 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-12 06:32:59,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:32:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:32:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1491695225, now seen corresponding path program 1 times [2022-07-12 06:32:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:32:59,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362675809] [2022-07-12 06:32:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:32:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:32:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:32:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:32:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:32:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:32:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 06:32:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 06:32:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:32:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 06:32:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:32:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 06:32:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,580 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-12 06:32:59,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:32:59,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362675809] [2022-07-12 06:32:59,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362675809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:32:59,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104712514] [2022-07-12 06:32:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:32:59,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:32:59,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:32:59,596 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-12 06:32:59,597 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-12 06:32:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:32:59,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 06:32:59,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:32:59,696 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-12 06:32:59,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:32:59,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104712514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:32:59,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:32:59,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 06:32:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462472984] [2022-07-12 06:32:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:32:59,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:32:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:32:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:32:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:32:59,699 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-12 06:32:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:32:59,848 INFO L93 Difference]: Finished difference Result 7498 states and 10341 transitions. [2022-07-12 06:32:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:32:59,849 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-12 06:32:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:32:59,865 INFO L225 Difference]: With dead ends: 7498 [2022-07-12 06:32:59,866 INFO L226 Difference]: Without dead ends: 4552 [2022-07-12 06:32:59,872 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-12 06:32:59,874 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-12 06:32:59,874 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-12 06:32:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2022-07-12 06:33:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4514. [2022-07-12 06:33:00,046 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-12 06:33:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6102 transitions. [2022-07-12 06:33:00,059 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6102 transitions. Word has length 134 [2022-07-12 06:33:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:00,059 INFO L495 AbstractCegarLoop]: Abstraction has 4514 states and 6102 transitions. [2022-07-12 06:33:00,059 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-12 06:33:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6102 transitions. [2022-07-12 06:33:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 06:33:00,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:00,069 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-12 06:33:00,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 06:33:00,289 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-12 06:33:00,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1657376431, now seen corresponding path program 1 times [2022-07-12 06:33:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:00,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254484032] [2022-07-12 06:33:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 06:33:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,374 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-12 06:33:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:00,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254484032] [2022-07-12 06:33:00,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254484032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:33:00,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261235263] [2022-07-12 06:33:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:33:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:33:00,376 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-12 06:33:00,377 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-12 06:33:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:00,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 06:33:00,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:33:00,479 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-12 06:33:00,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:33:00,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261235263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:00,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:33:00,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 06:33:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559325575] [2022-07-12 06:33:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:00,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:33:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:33:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:33:00,482 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-12 06:33:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:00,631 INFO L93 Difference]: Finished difference Result 6910 states and 9481 transitions. [2022-07-12 06:33:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:33:00,631 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-12 06:33:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:00,648 INFO L225 Difference]: With dead ends: 6910 [2022-07-12 06:33:00,649 INFO L226 Difference]: Without dead ends: 4550 [2022-07-12 06:33:00,656 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-12 06:33:00,658 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-12 06:33:00,658 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-12 06:33:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2022-07-12 06:33:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4490. [2022-07-12 06:33:00,802 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-12 06:33:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 5984 transitions. [2022-07-12 06:33:00,816 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 5984 transitions. Word has length 135 [2022-07-12 06:33:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:00,816 INFO L495 AbstractCegarLoop]: Abstraction has 4490 states and 5984 transitions. [2022-07-12 06:33:00,816 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-12 06:33:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 5984 transitions. [2022-07-12 06:33:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 06:33:00,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:00,840 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-12 06:33:00,861 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-12 06:33:01,051 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-12 06:33:01,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1768717425, now seen corresponding path program 1 times [2022-07-12 06:33:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:01,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684051674] [2022-07-12 06:33:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 06:33:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,127 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-12 06:33:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684051674] [2022-07-12 06:33:01,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684051674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:33:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985573844] [2022-07-12 06:33:01,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:01,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:33:01,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:33:01,129 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-12 06:33:01,131 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-12 06:33:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 06:33:01,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:33:01,221 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-12 06:33:01,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:33:01,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985573844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:01,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:33:01,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-12 06:33:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216544363] [2022-07-12 06:33:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:01,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:33:01,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:33:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:33:01,223 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-12 06:33:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:01,334 INFO L93 Difference]: Finished difference Result 7814 states and 10540 transitions. [2022-07-12 06:33:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:33:01,334 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-12 06:33:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:01,349 INFO L225 Difference]: With dead ends: 7814 [2022-07-12 06:33:01,349 INFO L226 Difference]: Without dead ends: 3872 [2022-07-12 06:33:01,358 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-12 06:33:01,359 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-12 06:33:01,360 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-12 06:33:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2022-07-12 06:33:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3642. [2022-07-12 06:33:01,555 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-12 06:33:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4642 transitions. [2022-07-12 06:33:01,566 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4642 transitions. Word has length 135 [2022-07-12 06:33:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:01,567 INFO L495 AbstractCegarLoop]: Abstraction has 3642 states and 4642 transitions. [2022-07-12 06:33:01,568 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-12 06:33:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4642 transitions. [2022-07-12 06:33:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 06:33:01,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:01,573 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-12 06:33:01,599 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-12 06:33:01,780 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-12 06:33:01,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -829055518, now seen corresponding path program 1 times [2022-07-12 06:33:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:01,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104152875] [2022-07-12 06:33:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 06:33:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,841 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-12 06:33:01,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:01,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104152875] [2022-07-12 06:33:01,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104152875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:33:01,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769601356] [2022-07-12 06:33:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:01,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:33:01,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:33:01,843 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-12 06:33:01,844 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-12 06:33:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:01,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:33:01,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:33:01,974 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-12 06:33:01,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:33:01,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769601356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:01,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:33:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-12 06:33:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043793094] [2022-07-12 06:33:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:01,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:33:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:33:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 06:33:01,976 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-12 06:33:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:02,154 INFO L93 Difference]: Finished difference Result 5070 states and 6521 transitions. [2022-07-12 06:33:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:33:02,155 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-12 06:33:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:02,166 INFO L225 Difference]: With dead ends: 5070 [2022-07-12 06:33:02,166 INFO L226 Difference]: Without dead ends: 2712 [2022-07-12 06:33:02,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 06:33:02,173 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-12 06:33:02,173 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-12 06:33:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2022-07-12 06:33:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2700. [2022-07-12 06:33:02,260 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-12 06:33:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3356 transitions. [2022-07-12 06:33:02,267 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3356 transitions. Word has length 136 [2022-07-12 06:33:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:02,267 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 3356 transitions. [2022-07-12 06:33:02,267 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-12 06:33:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3356 transitions. [2022-07-12 06:33:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 06:33:02,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:02,271 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-12 06:33:02,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 06:33:02,482 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-12 06:33:02,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1599203104, now seen corresponding path program 1 times [2022-07-12 06:33:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:02,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358995543] [2022-07-12 06:33:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 06:33:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,541 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-12 06:33:02,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:02,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358995543] [2022-07-12 06:33:02,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358995543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:33:02,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325856149] [2022-07-12 06:33:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:02,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:33:02,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:33:02,543 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-12 06:33:02,544 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-12 06:33:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:02,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:33:02,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:33:02,683 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-12 06:33:02,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:33:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325856149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:02,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:33:02,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-12 06:33:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569066134] [2022-07-12 06:33:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:33:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:02,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:33:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 06:33:02,685 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-12 06:33:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:02,902 INFO L93 Difference]: Finished difference Result 5041 states and 6343 transitions. [2022-07-12 06:33:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:33:02,903 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-12 06:33:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:02,921 INFO L225 Difference]: With dead ends: 5041 [2022-07-12 06:33:02,921 INFO L226 Difference]: Without dead ends: 2648 [2022-07-12 06:33:02,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:33:02,929 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-12 06:33:02,930 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-12 06:33:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2022-07-12 06:33:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1674. [2022-07-12 06:33:03,031 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-12 06:33:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2009 transitions. [2022-07-12 06:33:03,036 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2009 transitions. Word has length 136 [2022-07-12 06:33:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:03,036 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2009 transitions. [2022-07-12 06:33:03,036 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-12 06:33:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2009 transitions. [2022-07-12 06:33:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 06:33:03,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:03,038 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-12 06:33:03,055 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-12 06:33:03,251 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-12 06:33:03,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash 292060706, now seen corresponding path program 1 times [2022-07-12 06:33:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:03,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486934108] [2022-07-12 06:33:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:03,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 06:33:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,361 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-12 06:33:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486934108] [2022-07-12 06:33:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486934108] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:33:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126765795] [2022-07-12 06:33:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:03,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:33:03,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:33:03,363 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-12 06:33:03,403 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-12 06:33:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 06:33:03,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:33:03,460 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-12 06:33:03,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:33:03,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126765795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:03,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:33:03,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 06:33:03,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145831010] [2022-07-12 06:33:03,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:03,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:33:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:03,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:33:03,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:33:03,462 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-12 06:33:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:03,573 INFO L93 Difference]: Finished difference Result 2813 states and 3395 transitions. [2022-07-12 06:33:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:33:03,574 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-12 06:33:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:03,577 INFO L225 Difference]: With dead ends: 2813 [2022-07-12 06:33:03,577 INFO L226 Difference]: Without dead ends: 1149 [2022-07-12 06:33:03,579 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-12 06:33:03,580 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-12 06:33:03,580 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-12 06:33:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-12 06:33:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1113. [2022-07-12 06:33:03,621 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-12 06:33:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1296 transitions. [2022-07-12 06:33:03,624 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1296 transitions. Word has length 136 [2022-07-12 06:33:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:03,624 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1296 transitions. [2022-07-12 06:33:03,624 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-12 06:33:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1296 transitions. [2022-07-12 06:33:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 06:33:03,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:03,626 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-12 06:33:03,645 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-12 06:33:03,839 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-12 06:33:03,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1014844378, now seen corresponding path program 1 times [2022-07-12 06:33:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:03,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193673646] [2022-07-12 06:33:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 06:33:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,896 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-12 06:33:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193673646] [2022-07-12 06:33:03,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193673646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:33:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246815879] [2022-07-12 06:33:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:03,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:33:03,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:33:03,898 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-12 06:33:03,899 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-12 06:33:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:03,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 06:33:03,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:33:03,993 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-12 06:33:03,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:33:03,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246815879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:03,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:33:03,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 06:33:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151042151] [2022-07-12 06:33:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:03,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:33:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:33:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:33:03,994 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-12 06:33:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:04,062 INFO L93 Difference]: Finished difference Result 2244 states and 2657 transitions. [2022-07-12 06:33:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:33:04,062 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-12 06:33:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:04,065 INFO L225 Difference]: With dead ends: 2244 [2022-07-12 06:33:04,065 INFO L226 Difference]: Without dead ends: 1141 [2022-07-12 06:33:04,067 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-12 06:33:04,067 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-12 06:33:04,067 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-12 06:33:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-07-12 06:33:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1125. [2022-07-12 06:33:04,117 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-12 06:33:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1287 transitions. [2022-07-12 06:33:04,120 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1287 transitions. Word has length 136 [2022-07-12 06:33:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:04,120 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1287 transitions. [2022-07-12 06:33:04,120 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-12 06:33:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1287 transitions. [2022-07-12 06:33:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 06:33:04,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:04,123 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-12 06:33:04,139 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-12 06:33:04,335 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-12 06:33:04,335 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1278811050, now seen corresponding path program 1 times [2022-07-12 06:33:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:04,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939440764] [2022-07-12 06:33:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 06:33:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,408 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-12 06:33:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939440764] [2022-07-12 06:33:04,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939440764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:04,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:33:04,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:33:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768999130] [2022-07-12 06:33:04,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:04,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:33:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:04,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:33:04,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:33:04,411 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-12 06:33:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:04,880 INFO L93 Difference]: Finished difference Result 2085 states and 2361 transitions. [2022-07-12 06:33:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 06:33:04,880 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-12 06:33:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:04,885 INFO L225 Difference]: With dead ends: 2085 [2022-07-12 06:33:04,886 INFO L226 Difference]: Without dead ends: 2082 [2022-07-12 06:33:04,886 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-12 06:33:04,887 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 486 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12 06:33:04,887 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-12 06:33:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-07-12 06:33:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1501. [2022-07-12 06:33:04,963 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-12 06:33:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1715 transitions. [2022-07-12 06:33:04,966 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1715 transitions. Word has length 136 [2022-07-12 06:33:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:04,966 INFO L495 AbstractCegarLoop]: Abstraction has 1501 states and 1715 transitions. [2022-07-12 06:33:04,967 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-12 06:33:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1715 transitions. [2022-07-12 06:33:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 06:33:04,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:04,968 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-12 06:33:04,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 06:33:04,969 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1930463342, now seen corresponding path program 1 times [2022-07-12 06:33:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:04,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753802653] [2022-07-12 06:33:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:33:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:33:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 06:33:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 06:33:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:33:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:33:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 06:33:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 06:33:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 06:33:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 06:33:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:33:05,011 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-12 06:33:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:33:05,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753802653] [2022-07-12 06:33:05,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753802653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:33:05,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:33:05,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:33:05,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945367794] [2022-07-12 06:33:05,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:33:05,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:33:05,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:33:05,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:33:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:33:05,013 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-12 06:33:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:33:05,251 INFO L93 Difference]: Finished difference Result 2724 states and 3203 transitions. [2022-07-12 06:33:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:33:05,252 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-12 06:33:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:33:05,257 INFO L225 Difference]: With dead ends: 2724 [2022-07-12 06:33:05,257 INFO L226 Difference]: Without dead ends: 1864 [2022-07-12 06:33:05,259 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-12 06:33:05,259 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 142 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:33:05,259 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.1s Time] [2022-07-12 06:33:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-07-12 06:33:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1503. [2022-07-12 06:33:05,349 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-12 06:33:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1717 transitions. [2022-07-12 06:33:05,351 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1717 transitions. Word has length 140 [2022-07-12 06:33:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:33:05,352 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1717 transitions. [2022-07-12 06:33:05,352 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-12 06:33:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1717 transitions. [2022-07-12 06:33:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 06:33:05,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:33:05,354 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-12 06:33:05,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 06:33:05,354 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:33:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:33:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1514412424, now seen corresponding path program 1 times [2022-07-12 06:33:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:33:05,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554426120] [2022-07-12 06:33:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:33:05,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:33:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:33:05,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:33:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:33:05,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:33:05,393 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:33:05,393 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:33:05,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 06:33:05,397 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-12 06:33:05,399 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:33:05,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:33:05 BoogieIcfgContainer [2022-07-12 06:33:05,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:33:05,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:33:05,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:33:05,487 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:33:05,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:54" (3/4) ... [2022-07-12 06:33:05,489 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:33:05,569 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:33:05,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:33:05,569 INFO L158 Benchmark]: Toolchain (without parser) took 11506.29ms. Allocated memory was 113.2MB in the beginning and 463.5MB in the end (delta: 350.2MB). Free memory was 84.7MB in the beginning and 328.1MB in the end (delta: -243.4MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2022-07-12 06:33:05,570 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:33:05,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.28ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 84.4MB in the beginning and 110.5MB in the end (delta: -26.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-07-12 06:33:05,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.25ms. Allocated memory is still 138.4MB. Free memory was 110.5MB in the beginning and 108.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:33:05,571 INFO L158 Benchmark]: Boogie Preprocessor took 18.23ms. Allocated memory is still 138.4MB. Free memory was 108.5MB in the beginning and 106.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:33:05,571 INFO L158 Benchmark]: RCFGBuilder took 442.04ms. Allocated memory is still 138.4MB. Free memory was 106.9MB in the beginning and 91.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 06:33:05,572 INFO L158 Benchmark]: TraceAbstraction took 10699.90ms. Allocated memory was 138.4MB in the beginning and 463.5MB in the end (delta: 325.1MB). Free memory was 90.6MB in the beginning and 338.5MB in the end (delta: -248.0MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2022-07-12 06:33:05,572 INFO L158 Benchmark]: Witness Printer took 81.78ms. Allocated memory is still 463.5MB. Free memory was 338.5MB in the beginning and 328.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 06:33:05,575 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.28ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 84.4MB in the beginning and 110.5MB in the end (delta: -26.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.25ms. Allocated memory is still 138.4MB. Free memory was 110.5MB in the beginning and 108.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.23ms. Allocated memory is still 138.4MB. Free memory was 108.5MB in the beginning and 106.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.04ms. Allocated memory is still 138.4MB. Free memory was 106.9MB in the beginning and 91.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10699.90ms. Allocated memory was 138.4MB in the beginning and 463.5MB in the end (delta: 325.1MB). Free memory was 90.6MB in the beginning and 338.5MB in the end (delta: -248.0MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * Witness Printer took 81.78ms. Allocated memory is still 463.5MB. Free memory was 338.5MB in the beginning and 328.1MB 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: 10.6s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3274 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3166 mSDsluCounter, 7743 SdHoareTripleChecker+Invalid, 1.9s 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, 0.8s 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s 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-12 06:33:05,609 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