./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/psyco/psyco_abp_1-1.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 8e1064ca8851049d7703c5646c80faf613ee8a93 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 05:54:44,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 05:54:44,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 05:54:44,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 05:54:44,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 05:54:44,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 05:54:44,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 05:54:44,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 05:54:44,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 05:54:44,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 05:54:44,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 05:54:44,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 05:54:44,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 05:54:44,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 05:54:44,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 05:54:44,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 05:54:44,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 05:54:44,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 05:54:44,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 05:54:44,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 05:54:44,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 05:54:44,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 05:54:44,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 05:54:44,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 05:54:44,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 05:54:44,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 05:54:44,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 05:54:44,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 05:54:44,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 05:54:44,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 05:54:44,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 05:54:44,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 05:54:44,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 05:54:44,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 05:54:44,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 05:54:44,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 05:54:44,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 05:54:44,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 05:54:44,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 05:54:44,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 05:54:44,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 05:54:44,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 05:54:44,146 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 05:54:44,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 05:54:44,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 05:54:44,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 05:54:44,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 05:54:44,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 05:54:44,149 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 05:54:44,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 05:54:44,149 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 05:54:44,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 05:54:44,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 05:54:44,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 05:54:44,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 05:54:44,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 05:54:44,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 05:54:44,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 05:54:44,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 05:54:44,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 05:54:44,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 05:54:44,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 05:54:44,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 05:54:44,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 05:54:44,152 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 -> 8e1064ca8851049d7703c5646c80faf613ee8a93 [2021-08-29 05:54:44,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 05:54:44,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 05:54:44,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 05:54:44,435 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 05:54:44,436 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 05:54:44,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2021-08-29 05:54:44,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce76441e/271109b6e0d84057ab9bb6d35cd7db21/FLAG2da462d6f [2021-08-29 05:54:44,829 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 05:54:44,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2021-08-29 05:54:44,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce76441e/271109b6e0d84057ab9bb6d35cd7db21/FLAG2da462d6f [2021-08-29 05:54:45,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce76441e/271109b6e0d84057ab9bb6d35cd7db21 [2021-08-29 05:54:45,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 05:54:45,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 05:54:45,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 05:54:45,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 05:54:45,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 05:54:45,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230b2863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45, skipping insertion in model container [2021-08-29 05:54:45,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 05:54:45,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 05:54:45,418 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2021-08-29 05:54:45,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 05:54:45,428 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 05:54:45,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2021-08-29 05:54:45,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 05:54:45,525 INFO L208 MainTranslator]: Completed translation [2021-08-29 05:54:45,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45 WrapperNode [2021-08-29 05:54:45,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 05:54:45,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 05:54:45,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 05:54:45,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 05:54:45,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 05:54:45,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 05:54:45,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 05:54:45,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 05:54:45,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 05:54:45,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 05:54:45,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 05:54:45,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 05:54:45,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (1/1) ... [2021-08-29 05:54:45,612 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 05:54:45,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:45,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 05:54:45,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 05:54:45,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 05:54:45,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 05:54:45,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 05:54:45,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 05:54:45,927 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 05:54:45,928 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-29 05:54:45,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 05:54:45 BoogieIcfgContainer [2021-08-29 05:54:45,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 05:54:45,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 05:54:45,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 05:54:45,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 05:54:45,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 05:54:45" (1/3) ... [2021-08-29 05:54:45,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee2e960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 05:54:45, skipping insertion in model container [2021-08-29 05:54:45,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:54:45" (2/3) ... [2021-08-29 05:54:45,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee2e960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 05:54:45, skipping insertion in model container [2021-08-29 05:54:45,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 05:54:45" (3/3) ... [2021-08-29 05:54:45,953 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2021-08-29 05:54:45,956 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 05:54:45,956 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 05:54:45,985 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 05:54:45,989 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 05:54:45,989 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 05:54:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 05:54:46,003 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:46,003 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:46,003 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2021-08-29 05:54:46,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:46,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427248710] [2021-08-29 05:54:46,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:46,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:46,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:46,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427248710] [2021-08-29 05:54:46,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427248710] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:46,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:46,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 05:54:46,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252739656] [2021-08-29 05:54:46,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-29 05:54:46,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:46,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-29 05:54:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-29 05:54:46,197 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:46,449 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2021-08-29 05:54:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-29 05:54:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-29 05:54:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:46,457 INFO L225 Difference]: With dead ends: 218 [2021-08-29 05:54:46,457 INFO L226 Difference]: Without dead ends: 106 [2021-08-29 05:54:46,459 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-29 05:54:46,465 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 172.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.00ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 229.44ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:46,465 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 206 Unknown, 0 Unchecked, 1.00ms Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 229.44ms Time] [2021-08-29 05:54:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-08-29 05:54:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-08-29 05:54:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 105 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2021-08-29 05:54:46,491 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2021-08-29 05:54:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:46,491 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2021-08-29 05:54:46,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2021-08-29 05:54:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-29 05:54:46,492 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:46,492 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:46,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 05:54:46,493 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2021-08-29 05:54:46,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:46,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214769184] [2021-08-29 05:54:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:46,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:46,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:46,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214769184] [2021-08-29 05:54:46,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214769184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:46,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:46,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:46,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195125937] [2021-08-29 05:54:46,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:46,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:46,531 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:46,740 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2021-08-29 05:54:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-29 05:54:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:46,741 INFO L225 Difference]: With dead ends: 214 [2021-08-29 05:54:46,742 INFO L226 Difference]: Without dead ends: 110 [2021-08-29 05:54:46,742 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.76ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:46,743 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 152.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.80ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 195.72ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:46,743 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 350 Unknown, 0 Unchecked, 1.80ms Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 195.72ms Time] [2021-08-29 05:54:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-29 05:54:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-08-29 05:54:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.6697247706422018) internal successors, (182), 109 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2021-08-29 05:54:46,751 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2021-08-29 05:54:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:46,752 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2021-08-29 05:54:46,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2021-08-29 05:54:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 05:54:46,752 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:46,752 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:46,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 05:54:46,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2021-08-29 05:54:46,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:46,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273550420] [2021-08-29 05:54:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:46,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:46,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:46,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273550420] [2021-08-29 05:54:46,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273550420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:46,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:46,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:46,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911961411] [2021-08-29 05:54:46,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:46,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:46,845 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:47,141 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2021-08-29 05:54:47,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:47,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 05:54:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:47,143 INFO L225 Difference]: With dead ends: 324 [2021-08-29 05:54:47,143 INFO L226 Difference]: Without dead ends: 195 [2021-08-29 05:54:47,144 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.99ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:47,145 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 224.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.67ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 283.82ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:47,145 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 384 Unknown, 0 Unchecked, 1.67ms Time], IncrementalHoareTripleChecker [23 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 283.82ms Time] [2021-08-29 05:54:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-29 05:54:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2021-08-29 05:54:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.644808743169399) internal successors, (301), 183 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2021-08-29 05:54:47,153 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2021-08-29 05:54:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:47,154 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2021-08-29 05:54:47,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2021-08-29 05:54:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 05:54:47,154 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:47,155 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:47,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 05:54:47,155 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:47,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2021-08-29 05:54:47,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:47,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726182807] [2021-08-29 05:54:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:47,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:47,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:47,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726182807] [2021-08-29 05:54:47,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726182807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:47,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:47,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:47,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656204690] [2021-08-29 05:54:47,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:47,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:47,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:47,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:47,186 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:47,374 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2021-08-29 05:54:47,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:47,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 05:54:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:47,375 INFO L225 Difference]: With dead ends: 314 [2021-08-29 05:54:47,375 INFO L226 Difference]: Without dead ends: 133 [2021-08-29 05:54:47,376 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.43ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:47,377 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 140.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.98ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 177.01ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:47,377 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 327 Unknown, 0 Unchecked, 0.98ms Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 177.01ms Time] [2021-08-29 05:54:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-29 05:54:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2021-08-29 05:54:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.623076923076923) internal successors, (211), 130 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2021-08-29 05:54:47,382 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2021-08-29 05:54:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:47,382 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2021-08-29 05:54:47,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2021-08-29 05:54:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-29 05:54:47,383 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:47,383 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:47,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 05:54:47,383 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2021-08-29 05:54:47,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:47,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151429706] [2021-08-29 05:54:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:47,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 05:54:47,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:47,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151429706] [2021-08-29 05:54:47,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151429706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:47,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:47,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:47,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975340258] [2021-08-29 05:54:47,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:47,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:47,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:47,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:47,416 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:47,543 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2021-08-29 05:54:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:47,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-29 05:54:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:47,544 INFO L225 Difference]: With dead ends: 243 [2021-08-29 05:54:47,545 INFO L226 Difference]: Without dead ends: 115 [2021-08-29 05:54:47,545 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.33ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:47,546 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.64ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.22ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:47,546 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 200 Unknown, 0 Unchecked, 0.64ms Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 121.22ms Time] [2021-08-29 05:54:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-29 05:54:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2021-08-29 05:54:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5892857142857142) internal successors, (178), 112 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2021-08-29 05:54:47,550 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2021-08-29 05:54:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:47,551 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2021-08-29 05:54:47,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2021-08-29 05:54:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-29 05:54:47,552 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:47,552 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:47,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 05:54:47,552 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2021-08-29 05:54:47,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:47,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671075292] [2021-08-29 05:54:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:47,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:47,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:47,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671075292] [2021-08-29 05:54:47,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671075292] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:47,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601450641] [2021-08-29 05:54:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:47,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:47,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:47,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:47,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-29 05:54:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:47,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-29 05:54:47,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:47,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:54:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:47,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601450641] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:54:47,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:54:47,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-08-29 05:54:47,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577111963] [2021-08-29 05:54:47,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 05:54:47,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 05:54:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 05:54:47,809 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:48,188 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2021-08-29 05:54:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 05:54:48,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-29 05:54:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:48,190 INFO L225 Difference]: With dead ends: 204 [2021-08-29 05:54:48,190 INFO L226 Difference]: Without dead ends: 192 [2021-08-29 05:54:48,190 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.75ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 05:54:48,191 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 258 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 293.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 366.08ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:48,191 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 0 Invalid, 842 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [27 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 366.08ms Time] [2021-08-29 05:54:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-29 05:54:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2021-08-29 05:54:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.6384180790960452) internal successors, (290), 177 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2021-08-29 05:54:48,196 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2021-08-29 05:54:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:48,196 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2021-08-29 05:54:48,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2021-08-29 05:54:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-29 05:54:48,197 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:48,197 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:48,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:48,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-29 05:54:48,415 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2021-08-29 05:54:48,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:48,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774901608] [2021-08-29 05:54:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:48,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:48,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:48,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774901608] [2021-08-29 05:54:48,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774901608] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:48,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592650535] [2021-08-29 05:54:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:48,503 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:48,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:48,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:48,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-29 05:54:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:48,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-29 05:54:48,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:48,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:54:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:48,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592650535] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:54:48,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:54:48,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-08-29 05:54:48,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460052582] [2021-08-29 05:54:48,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 05:54:48,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 05:54:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-29 05:54:48,904 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:49,730 INFO L93 Difference]: Finished difference Result 509 states and 834 transitions. [2021-08-29 05:54:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 05:54:49,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-29 05:54:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:49,751 INFO L225 Difference]: With dead ends: 509 [2021-08-29 05:54:49,752 INFO L226 Difference]: Without dead ends: 340 [2021-08-29 05:54:49,752 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 43.13ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-29 05:54:49,754 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 590.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.64ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 800.55ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:49,755 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 1570 Unknown, 0 Unchecked, 3.64ms Time], IncrementalHoareTripleChecker [28 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 800.55ms Time] [2021-08-29 05:54:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-08-29 05:54:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 316. [2021-08-29 05:54:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.638095238095238) internal successors, (516), 315 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 516 transitions. [2021-08-29 05:54:49,775 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 516 transitions. Word has length 27 [2021-08-29 05:54:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:49,775 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 516 transitions. [2021-08-29 05:54:49,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 516 transitions. [2021-08-29 05:54:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-29 05:54:49,790 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:49,790 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:49,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:49,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-08-29 05:54:49,992 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:49,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:49,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2021-08-29 05:54:49,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:49,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981832907] [2021-08-29 05:54:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:49,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 05:54:50,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:50,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981832907] [2021-08-29 05:54:50,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981832907] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:50,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:50,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:50,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033841513] [2021-08-29 05:54:50,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:50,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:50,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:50,043 INFO L87 Difference]: Start difference. First operand 316 states and 516 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:50,153 INFO L93 Difference]: Finished difference Result 501 states and 815 transitions. [2021-08-29 05:54:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-29 05:54:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:50,157 INFO L225 Difference]: With dead ends: 501 [2021-08-29 05:54:50,157 INFO L226 Difference]: Without dead ends: 211 [2021-08-29 05:54:50,158 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.99ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:50,158 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.84ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:50,159 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 265 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 100.84ms Time] [2021-08-29 05:54:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-29 05:54:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2021-08-29 05:54:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2021-08-29 05:54:50,180 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2021-08-29 05:54:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:50,181 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2021-08-29 05:54:50,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2021-08-29 05:54:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 05:54:50,182 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:50,182 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:50,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 05:54:50,182 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2021-08-29 05:54:50,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:50,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3106377] [2021-08-29 05:54:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:50,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-29 05:54:50,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:50,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3106377] [2021-08-29 05:54:50,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3106377] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:50,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:50,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:50,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094242505] [2021-08-29 05:54:50,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:50,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:50,210 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:50,347 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2021-08-29 05:54:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:50,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-29 05:54:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:50,348 INFO L225 Difference]: With dead ends: 375 [2021-08-29 05:54:50,348 INFO L226 Difference]: Without dead ends: 211 [2021-08-29 05:54:50,349 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.14ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:50,349 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.75ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:50,350 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 128.75ms Time] [2021-08-29 05:54:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-29 05:54:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2021-08-29 05:54:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5769230769230769) internal successors, (328), 208 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2021-08-29 05:54:50,355 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2021-08-29 05:54:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:50,355 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2021-08-29 05:54:50,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2021-08-29 05:54:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 05:54:50,356 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:50,356 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:54:50,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 05:54:50,357 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:50,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:50,357 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2021-08-29 05:54:50,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:50,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656175246] [2021-08-29 05:54:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:50,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:50,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:50,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656175246] [2021-08-29 05:54:50,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656175246] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:50,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214840942] [2021-08-29 05:54:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:50,438 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:50,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:50,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:50,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-29 05:54:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:50,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 05:54:50,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 05:54:50,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:54:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 05:54:50,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214840942] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:54:50,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:54:50,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2021-08-29 05:54:50,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115707571] [2021-08-29 05:54:50,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 05:54:50,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:50,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 05:54:50,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-29 05:54:50,894 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:51,732 INFO L93 Difference]: Finished difference Result 650 states and 1012 transitions. [2021-08-29 05:54:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 05:54:51,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-08-29 05:54:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:51,734 INFO L225 Difference]: With dead ends: 650 [2021-08-29 05:54:51,734 INFO L226 Difference]: Without dead ends: 419 [2021-08-29 05:54:51,734 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 124.03ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-08-29 05:54:51,735 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 522 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 613.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.85ms SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 727.97ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:51,735 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 0 Invalid, 1409 Unknown, 0 Unchecked, 5.85ms Time], IncrementalHoareTripleChecker [101 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 727.97ms Time] [2021-08-29 05:54:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-08-29 05:54:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 382. [2021-08-29 05:54:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5774278215223096) internal successors, (601), 381 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 601 transitions. [2021-08-29 05:54:51,753 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 601 transitions. Word has length 37 [2021-08-29 05:54:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:51,754 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 601 transitions. [2021-08-29 05:54:51,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 601 transitions. [2021-08-29 05:54:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 05:54:51,755 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:51,755 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2021-08-29 05:54:51,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:51,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:51,971 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2021-08-29 05:54:51,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:51,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450885251] [2021-08-29 05:54:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:51,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 05:54:52,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:52,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450885251] [2021-08-29 05:54:52,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450885251] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:52,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716254862] [2021-08-29 05:54:52,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:52,019 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:52,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:52,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:52,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-29 05:54:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:52,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-29 05:54:52,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 05:54:52,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:54:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-29 05:54:52,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716254862] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:54:52,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:54:52,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-08-29 05:54:52,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075734200] [2021-08-29 05:54:52,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 05:54:52,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 05:54:52,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 05:54:52,241 INFO L87 Difference]: Start difference. First operand 382 states and 601 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:52,509 INFO L93 Difference]: Finished difference Result 396 states and 613 transitions. [2021-08-29 05:54:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 05:54:52,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-08-29 05:54:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:52,511 INFO L225 Difference]: With dead ends: 396 [2021-08-29 05:54:52,511 INFO L226 Difference]: Without dead ends: 384 [2021-08-29 05:54:52,511 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.31ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 05:54:52,511 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 202.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 255.60ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:52,511 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 527 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [16 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 255.60ms Time] [2021-08-29 05:54:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-08-29 05:54:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2021-08-29 05:54:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5354330708661417) internal successors, (585), 381 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 585 transitions. [2021-08-29 05:54:52,518 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 585 transitions. Word has length 38 [2021-08-29 05:54:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:52,518 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 585 transitions. [2021-08-29 05:54:52,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 585 transitions. [2021-08-29 05:54:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-29 05:54:52,518 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:52,518 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2021-08-29 05:54:52,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:52,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:52,735 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2021-08-29 05:54:52,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:52,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143863008] [2021-08-29 05:54:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:52,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:53,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:53,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143863008] [2021-08-29 05:54:53,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143863008] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:53,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956866437] [2021-08-29 05:54:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:53,060 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:53,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:53,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-29 05:54:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:53,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-29 05:54:53,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:53,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:54:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:53,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956866437] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:54:53,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:54:53,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-08-29 05:54:53,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261325291] [2021-08-29 05:54:53,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 05:54:53,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:53,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 05:54:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-29 05:54:53,733 INFO L87 Difference]: Start difference. First operand 382 states and 585 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:54,368 INFO L93 Difference]: Finished difference Result 397 states and 596 transitions. [2021-08-29 05:54:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 05:54:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-29 05:54:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:54,369 INFO L225 Difference]: With dead ends: 397 [2021-08-29 05:54:54,369 INFO L226 Difference]: Without dead ends: 395 [2021-08-29 05:54:54,370 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 138.95ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-29 05:54:54,370 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 412.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.94ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 586.79ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:54,370 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 1144 Unknown, 0 Unchecked, 1.94ms Time], IncrementalHoareTripleChecker [13 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 586.79ms Time] [2021-08-29 05:54:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-08-29 05:54:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 383. [2021-08-29 05:54:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5340314136125655) internal successors, (586), 382 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 586 transitions. [2021-08-29 05:54:54,376 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 586 transitions. Word has length 40 [2021-08-29 05:54:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:54,378 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 586 transitions. [2021-08-29 05:54:54,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 586 transitions. [2021-08-29 05:54:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-29 05:54:54,379 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:54,379 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2021-08-29 05:54:54,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:54,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-29 05:54:54,580 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2021-08-29 05:54:54,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:54,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431979897] [2021-08-29 05:54:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:54,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-29 05:54:54,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:54,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431979897] [2021-08-29 05:54:54,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431979897] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:54,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:54,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:54,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862072305] [2021-08-29 05:54:54,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:54,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:54,604 INFO L87 Difference]: Start difference. First operand 383 states and 586 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:54,765 INFO L93 Difference]: Finished difference Result 720 states and 1100 transitions. [2021-08-29 05:54:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:54,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-08-29 05:54:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:54,766 INFO L225 Difference]: With dead ends: 720 [2021-08-29 05:54:54,766 INFO L226 Difference]: Without dead ends: 382 [2021-08-29 05:54:54,767 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.24ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:54,767 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.48ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 151.58ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:54,768 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 267 Unknown, 0 Unchecked, 0.48ms Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 151.58ms Time] [2021-08-29 05:54:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-08-29 05:54:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2021-08-29 05:54:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.4986807387862797) internal successors, (568), 379 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 568 transitions. [2021-08-29 05:54:54,774 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 568 transitions. Word has length 41 [2021-08-29 05:54:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:54,774 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 568 transitions. [2021-08-29 05:54:54,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 568 transitions. [2021-08-29 05:54:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-29 05:54:54,775 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:54,775 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2021-08-29 05:54:54,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 05:54:54,776 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1803942129, now seen corresponding path program 1 times [2021-08-29 05:54:54,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:54,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106488935] [2021-08-29 05:54:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:54,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-08-29 05:54:54,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:54,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106488935] [2021-08-29 05:54:54,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106488935] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:54,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 05:54:54,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 05:54:54,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242559391] [2021-08-29 05:54:54,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 05:54:54,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:54,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 05:54:54,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:54,802 INFO L87 Difference]: Start difference. First operand 380 states and 568 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:54,958 INFO L93 Difference]: Finished difference Result 548 states and 819 transitions. [2021-08-29 05:54:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 05:54:54,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-29 05:54:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:54,960 INFO L225 Difference]: With dead ends: 548 [2021-08-29 05:54:54,960 INFO L226 Difference]: Without dead ends: 233 [2021-08-29 05:54:54,960 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.21ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 05:54:54,961 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 124.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.44ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 147.90ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:54,961 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 223 Unknown, 0 Unchecked, 0.44ms Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 147.90ms Time] [2021-08-29 05:54:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-29 05:54:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2021-08-29 05:54:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4565217391304348) internal successors, (335), 230 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions. [2021-08-29 05:54:54,966 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 51 [2021-08-29 05:54:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:54,966 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions. [2021-08-29 05:54:54,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions. [2021-08-29 05:54:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-29 05:54:54,967 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:54,967 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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] [2021-08-29 05:54:54,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 05:54:54,967 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash -866165618, now seen corresponding path program 1 times [2021-08-29 05:54:54,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:54,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966577273] [2021-08-29 05:54:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:54,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 05:54:54,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:54,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966577273] [2021-08-29 05:54:55,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966577273] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:55,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088200375] [2021-08-29 05:54:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:55,000 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:55,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:55,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:55,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-29 05:54:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:55,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 05:54:55,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 05:54:55,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:54:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 05:54:55,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088200375] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:54:55,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:54:55,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-08-29 05:54:55,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587721629] [2021-08-29 05:54:55,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 05:54:55,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:55,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 05:54:55,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-29 05:54:55,338 INFO L87 Difference]: Start difference. First operand 231 states and 335 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:56,115 INFO L93 Difference]: Finished difference Result 884 states and 1314 transitions. [2021-08-29 05:54:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-29 05:54:56,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-08-29 05:54:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:56,118 INFO L225 Difference]: With dead ends: 884 [2021-08-29 05:54:56,118 INFO L226 Difference]: Without dead ends: 793 [2021-08-29 05:54:56,120 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 28.36ms TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-29 05:54:56,121 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 855 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 584.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.80ms SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 732.30ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:56,121 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 0 Invalid, 1072 Unknown, 0 Unchecked, 4.80ms Time], IncrementalHoareTripleChecker [74 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 732.30ms Time] [2021-08-29 05:54:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2021-08-29 05:54:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 746. [2021-08-29 05:54:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.476510067114094) internal successors, (1100), 745 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1100 transitions. [2021-08-29 05:54:56,136 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1100 transitions. Word has length 52 [2021-08-29 05:54:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:56,137 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1100 transitions. [2021-08-29 05:54:56,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1100 transitions. [2021-08-29 05:54:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-29 05:54:56,137 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:56,138 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2021-08-29 05:54:56,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:56,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-29 05:54:56,355 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1723595032, now seen corresponding path program 1 times [2021-08-29 05:54:56,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:56,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315048551] [2021-08-29 05:54:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:56,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 05:54:56,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:56,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315048551] [2021-08-29 05:54:56,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315048551] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:56,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30255447] [2021-08-29 05:54:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:56,466 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:56,467 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:56,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-29 05:54:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:56,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 05:54:56,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 05:54:56,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 05:54:56,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30255447] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 05:54:56,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 05:54:56,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-08-29 05:54:56,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768697296] [2021-08-29 05:54:56,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 05:54:56,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 05:54:56,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-29 05:54:56,646 INFO L87 Difference]: Start difference. First operand 746 states and 1100 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:56,879 INFO L93 Difference]: Finished difference Result 753 states and 1104 transitions. [2021-08-29 05:54:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 05:54:56,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-08-29 05:54:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:56,881 INFO L225 Difference]: With dead ends: 753 [2021-08-29 05:54:56,881 INFO L226 Difference]: Without dead ends: 750 [2021-08-29 05:54:56,882 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 35.83ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-29 05:54:56,882 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 174.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 221.23ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:56,882 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 475 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 221.23ms Time] [2021-08-29 05:54:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-08-29 05:54:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 746. [2021-08-29 05:54:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.47248322147651) internal successors, (1097), 745 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1097 transitions. [2021-08-29 05:54:56,902 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1097 transitions. Word has length 55 [2021-08-29 05:54:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:56,903 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1097 transitions. [2021-08-29 05:54:56,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1097 transitions. [2021-08-29 05:54:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-29 05:54:56,903 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:56,904 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2021-08-29 05:54:56,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:57,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:57,119 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2021-08-29 05:54:57,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:57,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590550114] [2021-08-29 05:54:57,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:57,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:57,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:57,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590550114] [2021-08-29 05:54:57,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590550114] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:57,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115391681] [2021-08-29 05:54:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:57,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:57,315 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:57,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-29 05:54:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:57,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-29 05:54:57,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:57,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:54:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:58,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115391681] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:54:58,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:54:58,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2021-08-29 05:54:58,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016752407] [2021-08-29 05:54:58,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-29 05:54:58,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:54:58,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-29 05:54:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-29 05:54:58,240 INFO L87 Difference]: Start difference. First operand 746 states and 1097 transitions. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:54:58,752 INFO L93 Difference]: Finished difference Result 754 states and 1101 transitions. [2021-08-29 05:54:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 05:54:58,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-08-29 05:54:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:54:58,755 INFO L225 Difference]: With dead ends: 754 [2021-08-29 05:54:58,755 INFO L226 Difference]: Without dead ends: 752 [2021-08-29 05:54:58,755 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 99.67ms TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-29 05:54:58,755 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 403.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.45ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 494.94ms IncrementalHoareTripleChecker+Time [2021-08-29 05:54:58,756 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 1184 Unknown, 0 Unchecked, 2.45ms Time], IncrementalHoareTripleChecker [5 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 494.94ms Time] [2021-08-29 05:54:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-08-29 05:54:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 746. [2021-08-29 05:54:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.4684563758389262) internal successors, (1094), 745 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1094 transitions. [2021-08-29 05:54:58,774 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1094 transitions. Word has length 56 [2021-08-29 05:54:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:54:58,775 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1094 transitions. [2021-08-29 05:54:58,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:54:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1094 transitions. [2021-08-29 05:54:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-29 05:54:58,775 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:54:58,775 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2021-08-29 05:54:58,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-29 05:54:58,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-29 05:54:58,992 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:54:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:54:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2021-08-29 05:54:58,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:54:58,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986078543] [2021-08-29 05:54:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:58,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:54:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:59,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:54:59,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986078543] [2021-08-29 05:54:59,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986078543] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:54:59,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644992450] [2021-08-29 05:54:59,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:54:59,159 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:54:59,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:54:59,173 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:54:59,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-29 05:54:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:54:59,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-29 05:54:59,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:54:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:54:59,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:55:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 05:55:00,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644992450] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:55:00,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:55:00,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2021-08-29 05:55:00,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725802573] [2021-08-29 05:55:00,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-29 05:55:00,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:55:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-29 05:55:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-29 05:55:00,072 INFO L87 Difference]: Start difference. First operand 746 states and 1094 transitions. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:55:00,865 INFO L93 Difference]: Finished difference Result 855 states and 1241 transitions. [2021-08-29 05:55:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 05:55:00,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-29 05:55:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:55:00,868 INFO L225 Difference]: With dead ends: 855 [2021-08-29 05:55:00,868 INFO L226 Difference]: Without dead ends: 845 [2021-08-29 05:55:00,869 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 119.75ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-08-29 05:55:00,869 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 384 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 599.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.33ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 733.34ms IncrementalHoareTripleChecker+Time [2021-08-29 05:55:00,869 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 0 Invalid, 1821 Unknown, 0 Unchecked, 3.33ms Time], IncrementalHoareTripleChecker [28 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 733.34ms Time] [2021-08-29 05:55:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-08-29 05:55:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 828. [2021-08-29 05:55:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4292623941958889) internal successors, (1182), 827 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1182 transitions. [2021-08-29 05:55:00,883 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1182 transitions. Word has length 63 [2021-08-29 05:55:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:55:00,883 INFO L470 AbstractCegarLoop]: Abstraction has 828 states and 1182 transitions. [2021-08-29 05:55:00,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1182 transitions. [2021-08-29 05:55:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-29 05:55:00,884 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:55:00,884 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 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] [2021-08-29 05:55:00,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-08-29 05:55:01,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-29 05:55:01,102 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:55:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:55:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2021-08-29 05:55:01,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:55:01,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069860212] [2021-08-29 05:55:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:01,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:55:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:55:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:55:01,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:55:01,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069860212] [2021-08-29 05:55:01,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069860212] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:55:01,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422699409] [2021-08-29 05:55:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:01,368 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:55:01,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:55:01,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:55:01,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-29 05:55:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:55:01,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-29 05:55:01,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:55:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:55:02,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:55:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:55:02,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422699409] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:55:02,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:55:02,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2021-08-29 05:55:02,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857166942] [2021-08-29 05:55:02,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-29 05:55:02,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:55:02,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-29 05:55:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-08-29 05:55:02,580 INFO L87 Difference]: Start difference. First operand 828 states and 1182 transitions. Second operand has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:55:03,238 INFO L93 Difference]: Finished difference Result 834 states and 1185 transitions. [2021-08-29 05:55:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 05:55:03,239 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-29 05:55:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:55:03,241 INFO L225 Difference]: With dead ends: 834 [2021-08-29 05:55:03,241 INFO L226 Difference]: Without dead ends: 832 [2021-08-29 05:55:03,241 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 131.11ms TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-08-29 05:55:03,242 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 313 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 512.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.00ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 634.94ms IncrementalHoareTripleChecker+Time [2021-08-29 05:55:03,242 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 0 Invalid, 1725 Unknown, 0 Unchecked, 3.00ms Time], IncrementalHoareTripleChecker [6 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 634.94ms Time] [2021-08-29 05:55:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-08-29 05:55:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 828. [2021-08-29 05:55:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.426844014510278) internal successors, (1180), 827 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1180 transitions. [2021-08-29 05:55:03,254 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1180 transitions. Word has length 86 [2021-08-29 05:55:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:55:03,255 INFO L470 AbstractCegarLoop]: Abstraction has 828 states and 1180 transitions. [2021-08-29 05:55:03,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1180 transitions. [2021-08-29 05:55:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-29 05:55:03,256 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:55:03,256 INFO L513 BasicCegarLoop]: trace histogram [13, 12, 12, 9, 9, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:55:03,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-29 05:55:03,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:55:03,473 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:55:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:55:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash -520376012, now seen corresponding path program 1 times [2021-08-29 05:55:03,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:55:03,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529981027] [2021-08-29 05:55:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:03,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:55:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:55:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-29 05:55:03,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:55:03,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529981027] [2021-08-29 05:55:03,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529981027] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:55:03,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465184706] [2021-08-29 05:55:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:03,567 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:55:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:55:03,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:55:03,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-29 05:55:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:55:03,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-29 05:55:03,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:55:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-29 05:55:04,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:55:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 91 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-29 05:55:04,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465184706] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:55:04,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:55:04,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-08-29 05:55:04,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617785840] [2021-08-29 05:55:04,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-29 05:55:04,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:55:04,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-29 05:55:04,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2021-08-29 05:55:04,277 INFO L87 Difference]: Start difference. First operand 828 states and 1180 transitions. Second operand has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:55:05,525 INFO L93 Difference]: Finished difference Result 2453 states and 3478 transitions. [2021-08-29 05:55:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-29 05:55:05,526 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2021-08-29 05:55:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:55:05,531 INFO L225 Difference]: With dead ends: 2453 [2021-08-29 05:55:05,531 INFO L226 Difference]: Without dead ends: 1889 [2021-08-29 05:55:05,531 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 65.85ms TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2021-08-29 05:55:05,532 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2214 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 913.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.66ms SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1155.20ms IncrementalHoareTripleChecker+Time [2021-08-29 05:55:05,532 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2214 Valid, 0 Invalid, 2153 Unknown, 0 Unchecked, 5.66ms Time], IncrementalHoareTripleChecker [200 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 1155.20ms Time] [2021-08-29 05:55:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2021-08-29 05:55:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1764. [2021-08-29 05:55:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 1.4316505955757233) internal successors, (2524), 1763 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2524 transitions. [2021-08-29 05:55:05,590 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2524 transitions. Word has length 147 [2021-08-29 05:55:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:55:05,590 INFO L470 AbstractCegarLoop]: Abstraction has 1764 states and 2524 transitions. [2021-08-29 05:55:05,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.0) internal successors, (238), 17 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2524 transitions. [2021-08-29 05:55:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-29 05:55:05,591 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:55:05,591 INFO L513 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:55:05,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-29 05:55:05,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:55:05,792 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:55:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:55:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 1 times [2021-08-29 05:55:05,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:55:05,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151106706] [2021-08-29 05:55:05,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:05,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:55:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:55:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:55:06,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:55:06,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151106706] [2021-08-29 05:55:06,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151106706] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:55:06,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906481893] [2021-08-29 05:55:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:06,093 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:55:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:55:06,094 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:55:06,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-29 05:55:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:55:06,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-29 05:55:06,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:55:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:55:06,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:55:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 174 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 05:55:07,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906481893] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:55:07,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:55:07,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2021-08-29 05:55:07,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233576478] [2021-08-29 05:55:07,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-29 05:55:07,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:55:07,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-29 05:55:07,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2021-08-29 05:55:07,951 INFO L87 Difference]: Start difference. First operand 1764 states and 2524 transitions. Second operand has 37 states, 37 states have (on average 11.324324324324325) internal successors, (419), 37 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:55:09,354 INFO L93 Difference]: Finished difference Result 1770 states and 2527 transitions. [2021-08-29 05:55:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-29 05:55:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 11.324324324324325) internal successors, (419), 37 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-08-29 05:55:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:55:09,358 INFO L225 Difference]: With dead ends: 1770 [2021-08-29 05:55:09,358 INFO L226 Difference]: Without dead ends: 1768 [2021-08-29 05:55:09,359 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 478.64ms TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2021-08-29 05:55:09,360 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 533 mSDsluCounter, 3780 mSDsCounter, 0 mSdLazyCounter, 4632 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1094.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.99ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1350.61ms IncrementalHoareTripleChecker+Time [2021-08-29 05:55:09,360 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 0 Invalid, 4642 Unknown, 0 Unchecked, 7.99ms Time], IncrementalHoareTripleChecker [10 Valid, 4632 Invalid, 0 Unknown, 0 Unchecked, 1350.61ms Time] [2021-08-29 05:55:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2021-08-29 05:55:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1764. [2021-08-29 05:55:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 1.4288145207033465) internal successors, (2519), 1763 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2519 transitions. [2021-08-29 05:55:09,428 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2519 transitions. Word has length 148 [2021-08-29 05:55:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:55:09,429 INFO L470 AbstractCegarLoop]: Abstraction has 1764 states and 2519 transitions. [2021-08-29 05:55:09,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 11.324324324324325) internal successors, (419), 37 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2519 transitions. [2021-08-29 05:55:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2021-08-29 05:55:09,432 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:55:09,432 INFO L513 BasicCegarLoop]: trace histogram [29, 28, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:55:09,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-29 05:55:09,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-29 05:55:09,649 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:55:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:55:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash -691826832, now seen corresponding path program 2 times [2021-08-29 05:55:09,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:55:09,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50925396] [2021-08-29 05:55:09,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:09,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:55:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 05:55:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-29 05:55:10,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 05:55:10,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50925396] [2021-08-29 05:55:10,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50925396] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 05:55:10,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422148929] [2021-08-29 05:55:10,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 05:55:10,016 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 05:55:10,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 05:55:10,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 05:55:10,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-29 05:55:10,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 05:55:10,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 05:55:10,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 1953 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-29 05:55:10,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 05:55:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-29 05:55:10,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 05:55:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 227 proven. 2258 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-29 05:55:11,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422148929] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 05:55:11,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 05:55:11,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 20 [2021-08-29 05:55:11,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127375787] [2021-08-29 05:55:11,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-29 05:55:11,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 05:55:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-29 05:55:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2021-08-29 05:55:11,503 INFO L87 Difference]: Start difference. First operand 1764 states and 2519 transitions. Second operand has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 05:55:13,049 INFO L93 Difference]: Finished difference Result 3416 states and 4857 transitions. [2021-08-29 05:55:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-29 05:55:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2021-08-29 05:55:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 05:55:13,055 INFO L225 Difference]: With dead ends: 3416 [2021-08-29 05:55:13,055 INFO L226 Difference]: Without dead ends: 2228 [2021-08-29 05:55:13,056 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 134.64ms TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2021-08-29 05:55:13,056 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2628 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1130.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2628 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.13ms SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1409.04ms IncrementalHoareTripleChecker+Time [2021-08-29 05:55:13,056 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2628 Valid, 0 Invalid, 2571 Unknown, 0 Unchecked, 7.13ms Time], IncrementalHoareTripleChecker [161 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 1409.04ms Time] [2021-08-29 05:55:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2021-08-29 05:55:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2115. [2021-08-29 05:55:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2114 states have (on average 1.4290444654683065) internal successors, (3021), 2114 states have internal predecessors, (3021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 3021 transitions. [2021-08-29 05:55:13,097 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 3021 transitions. Word has length 331 [2021-08-29 05:55:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 05:55:13,098 INFO L470 AbstractCegarLoop]: Abstraction has 2115 states and 3021 transitions. [2021-08-29 05:55:13,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.3) internal successors, (326), 20 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 05:55:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 3021 transitions. [2021-08-29 05:55:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2021-08-29 05:55:13,129 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 05:55:13,130 INFO L513 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 05:55:13,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-29 05:55:13,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-29 05:55:13,330 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 05:55:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 05:55:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 1 times [2021-08-29 05:55:13,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 05:55:13,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322039355] [2021-08-29 05:55:13,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 05:55:13,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 05:55:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 05:55:14,587 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 05:55:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 05:55:15,272 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 05:55:15,273 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 05:55:15,274 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 05:55:15,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-29 05:55:15,281 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 05:55:15,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 05:55:15 BoogieIcfgContainer [2021-08-29 05:55:15,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 05:55:15,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 05:55:15,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 05:55:15,431 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 05:55:15,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 05:54:45" (3/4) ... [2021-08-29 05:55:15,432 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 05:55:15,569 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 05:55:15,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 05:55:15,570 INFO L158 Benchmark]: Toolchain (without parser) took 30350.75ms. Allocated memory was 58.7MB in the beginning and 339.7MB in the end (delta: 281.0MB). Free memory was 42.8MB in the beginning and 183.7MB in the end (delta: -140.9MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. [2021-08-29 05:55:15,570 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.4MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 05:55:15,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.11ms. Allocated memory is still 58.7MB. Free memory was 42.6MB in the beginning and 37.6MB in the end (delta: 5.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-08-29 05:55:15,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.86ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 33.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 05:55:15,573 INFO L158 Benchmark]: Boogie Preprocessor took 26.18ms. Allocated memory is still 58.7MB. Free memory was 32.8MB in the beginning and 30.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 05:55:15,573 INFO L158 Benchmark]: RCFGBuilder took 336.26ms. Allocated memory is still 58.7MB. Free memory was 30.0MB in the beginning and 32.5MB in the end (delta: -2.5MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2021-08-29 05:55:15,574 INFO L158 Benchmark]: TraceAbstraction took 29480.53ms. Allocated memory was 58.7MB in the beginning and 339.7MB in the end (delta: 281.0MB). Free memory was 32.0MB in the beginning and 229.0MB in the end (delta: -197.0MB). Peak memory consumption was 209.0MB. Max. memory is 16.1GB. [2021-08-29 05:55:15,574 INFO L158 Benchmark]: Witness Printer took 139.25ms. Allocated memory is still 339.7MB. Free memory was 229.0MB in the beginning and 183.7MB in the end (delta: 45.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2021-08-29 05:55:15,580 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.09ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.4MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.11ms. Allocated memory is still 58.7MB. Free memory was 42.6MB in the beginning and 37.6MB in the end (delta: 5.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.86ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 33.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.18ms. Allocated memory is still 58.7MB. Free memory was 32.8MB in the beginning and 30.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 336.26ms. Allocated memory is still 58.7MB. Free memory was 30.0MB in the beginning and 32.5MB in the end (delta: -2.5MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29480.53ms. Allocated memory was 58.7MB in the beginning and 339.7MB in the end (delta: 281.0MB). Free memory was 32.0MB in the beginning and 229.0MB in the end (delta: -197.0MB). Peak memory consumption was 209.0MB. Max. memory is 16.1GB. * Witness Printer took 139.25ms. Allocated memory is still 339.7MB. Free memory was 229.0MB in the beginning and 183.7MB in the end (delta: 45.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L571] reach_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29295.01ms, OverallIterations: 23, TraceHistogramMax: 35, EmptinessCheckTime: 52.02ms, AutomataDifference: 11925.33ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 7.47ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9146 SdHoareTripleChecker+Valid, 11004.86ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9146 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 8750.25ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15678 mSDsCounter, 714 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22876 IncrementalHoareTripleChecker+Invalid, 23590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 714 mSolverCounterUnsat, 0 mSDtfsCounter, 22876 mSolverCounterSat, 58.25ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2290 GetRequests, 2115 SyntacticMatches, 17 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1436.14ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2115occurred in iteration=22, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 374.01ms AutomataMinimizationTime, 22 MinimizatonAttempts, 432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 286.95ms SsaConstructionTime, 2417.33ms SatisfiabilityAnalysisTime, 9992.91ms InterpolantComputationTime, 2843 NumberOfCodeBlocks, 2843 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3452 ConstructedInterpolants, 0 QuantifiedInterpolants, 21442 SizeOfPredicates, 31 NumberOfNonLiveVariables, 7033 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 2067/11703 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 05:55:15,641 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...